./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.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_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/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_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/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_45cbc1d9-b5cf-4235-bacc-a62015999c18/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 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:10:00,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:10:00,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:10:00,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:10:00,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:10:00,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:10:00,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:10:00,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:10:00,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:10:00,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:10:00,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:10:00,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:10:00,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:10:00,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:10:00,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:10:00,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:10:00,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:10:00,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:10:00,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:10:00,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:10:00,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:10:00,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:10:00,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:10:00,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:10:00,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:10:00,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:10:00,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:10:00,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:10:00,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:10:00,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:10:00,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:10:00,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:10:00,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:10:00,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:10:00,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:10:00,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:10:00,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:10:00,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:10:00,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:10:00,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:10:00,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:10:00,734 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:10:00,752 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:10:00,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:10:00,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:10:00,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:10:00,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:10:00,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:10:00,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:10:00,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:10:00,755 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:10:00,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:10:00,755 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:10:00,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:10:00,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:10:00,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:10:00,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:10:00,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:10:00,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:10:00,757 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:10:00,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:10:00,757 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:10:00,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:10:00,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:10:00,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:10:00,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:10:00,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:10:00,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:10:00,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:10:00,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:10:00,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:10:00,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:10:00,759 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:10:00,759 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:10:00,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:10:00,759 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:10:00,759 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_45cbc1d9-b5cf-4235-bacc-a62015999c18/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_45cbc1d9-b5cf-4235-bacc-a62015999c18/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 -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2021-12-07 00:10:00,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:10:00,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:10:00,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:10:00,977 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:10:00,977 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:10:00,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2021-12-07 00:10:01,024 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/data/d05494bb7/6d30ebd2a3034e98805550646d3d41c0/FLAG2fd69a05d [2021-12-07 00:10:01,450 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:10:01,451 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2021-12-07 00:10:01,463 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/data/d05494bb7/6d30ebd2a3034e98805550646d3d41c0/FLAG2fd69a05d [2021-12-07 00:10:01,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/data/d05494bb7/6d30ebd2a3034e98805550646d3d41c0 [2021-12-07 00:10:01,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:10:01,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:10:01,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:10:01,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:10:01,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:10:01,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e91b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01, skipping insertion in model container [2021-12-07 00:10:01,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:10:01,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:10:01,623 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_45cbc1d9-b5cf-4235-bacc-a62015999c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2021-12-07 00:10:01,660 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_45cbc1d9-b5cf-4235-bacc-a62015999c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2021-12-07 00:10:01,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:10:01,689 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:10:01,698 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_45cbc1d9-b5cf-4235-bacc-a62015999c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2021-12-07 00:10:01,716 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_45cbc1d9-b5cf-4235-bacc-a62015999c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2021-12-07 00:10:01,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:10:01,744 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:10:01,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01 WrapperNode [2021-12-07 00:10:01,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:10:01,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:10:01,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:10:01,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:10:01,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,785 INFO L137 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 445 [2021-12-07 00:10:01,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:10:01,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:10:01,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:10:01,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:10:01,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:10:01,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:10:01,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:10:01,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:10:01,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (1/1) ... [2021-12-07 00:10:01,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:10:01,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:01,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:10:01,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:10:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:10:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-07 00:10:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-07 00:10:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-07 00:10:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-07 00:10:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-07 00:10:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-07 00:10:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-07 00:10:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-07 00:10:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-07 00:10:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-07 00:10:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-07 00:10:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-07 00:10:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-07 00:10:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-07 00:10:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-07 00:10:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-07 00:10:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-07 00:10:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-07 00:10:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-07 00:10:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-07 00:10:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-07 00:10:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-07 00:10:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:10:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-07 00:10:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-07 00:10:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-07 00:10:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-07 00:10:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:10:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:10:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-07 00:10:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-07 00:10:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-07 00:10:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-07 00:10:01,946 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:10:01,948 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:10:02,250 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-07 00:10:02,250 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-12-07 00:10:02,281 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:10:02,290 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:10:02,290 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-07 00:10:02,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:10:02 BoogieIcfgContainer [2021-12-07 00:10:02,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:10:02,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:10:02,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:10:02,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:10:02,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:10:01" (1/3) ... [2021-12-07 00:10:02,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38721e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:10:02, skipping insertion in model container [2021-12-07 00:10:02,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:10:01" (2/3) ... [2021-12-07 00:10:02,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38721e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:10:02, skipping insertion in model container [2021-12-07 00:10:02,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:10:02" (3/3) ... [2021-12-07 00:10:02,299 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2021-12-07 00:10:02,303 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:10:02,303 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-07 00:10:02,343 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:10:02,349 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-07 00:10:02,349 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-07 00:10:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-07 00:10:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 00:10:02,381 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:02,381 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] [2021-12-07 00:10:02,382 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash 560703049, now seen corresponding path program 1 times [2021-12-07 00:10:02,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:02,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829390864] [2021-12-07 00:10:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:02,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:02,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:02,606 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-07 00:10:02,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:02,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829390864] [2021-12-07 00:10:02,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829390864] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:02,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:02,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:10:02,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687685184] [2021-12-07 00:10:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:02,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:10:02,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:02,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:10:02,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:10:02,634 INFO L87 Difference]: Start difference. First operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:03,162 INFO L93 Difference]: Finished difference Result 584 states and 884 transitions. [2021-12-07 00:10:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:10:03,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-07 00:10:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:03,175 INFO L225 Difference]: With dead ends: 584 [2021-12-07 00:10:03,175 INFO L226 Difference]: Without dead ends: 359 [2021-12-07 00:10:03,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:10:03,182 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 572 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:03,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 891 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 00:10:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-07 00:10:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 316. [2021-12-07 00:10:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2021-12-07 00:10:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 452 transitions. [2021-12-07 00:10:03,239 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 452 transitions. Word has length 58 [2021-12-07 00:10:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:03,239 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 452 transitions. [2021-12-07 00:10:03,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2021-12-07 00:10:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 00:10:03,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:03,243 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] [2021-12-07 00:10:03,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:10:03,243 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1940005051, now seen corresponding path program 1 times [2021-12-07 00:10:03,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:03,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107913127] [2021-12-07 00:10:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:03,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,329 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-07 00:10:03,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:03,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107913127] [2021-12-07 00:10:03,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107913127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:03,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:03,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:10:03,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019583739] [2021-12-07 00:10:03,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:03,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:10:03,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:10:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:10:03,332 INFO L87 Difference]: Start difference. First operand 316 states and 452 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:03,787 INFO L93 Difference]: Finished difference Result 667 states and 960 transitions. [2021-12-07 00:10:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 00:10:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-07 00:10:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:03,793 INFO L225 Difference]: With dead ends: 667 [2021-12-07 00:10:03,793 INFO L226 Difference]: Without dead ends: 472 [2021-12-07 00:10:03,796 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-07 00:10:03,797 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 547 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:03,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 1246 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 00:10:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-12-07 00:10:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 406. [2021-12-07 00:10:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-12-07 00:10:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 579 transitions. [2021-12-07 00:10:03,839 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 579 transitions. Word has length 58 [2021-12-07 00:10:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:03,840 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 579 transitions. [2021-12-07 00:10:03,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 579 transitions. [2021-12-07 00:10:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 00:10:03,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:03,842 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] [2021-12-07 00:10:03,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:10:03,843 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1046518713, now seen corresponding path program 1 times [2021-12-07 00:10:03,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:03,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834273650] [2021-12-07 00:10:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:03,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:03,910 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-07 00:10:03,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834273650] [2021-12-07 00:10:03,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834273650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:03,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:03,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:10:03,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671148540] [2021-12-07 00:10:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:03,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:10:03,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:10:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:10:03,912 INFO L87 Difference]: Start difference. First operand 406 states and 579 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:04,450 INFO L93 Difference]: Finished difference Result 1018 states and 1457 transitions. [2021-12-07 00:10:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 00:10:04,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-07 00:10:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:04,455 INFO L225 Difference]: With dead ends: 1018 [2021-12-07 00:10:04,455 INFO L226 Difference]: Without dead ends: 733 [2021-12-07 00:10:04,456 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-07 00:10:04,457 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 560 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:04,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 1247 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 00:10:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-12-07 00:10:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 581. [2021-12-07 00:10:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 467 states have (on average 1.4539614561027838) internal successors, (679), 476 states have internal predecessors, (679), 71 states have call successors, (71), 39 states have call predecessors, (71), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2021-12-07 00:10:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 830 transitions. [2021-12-07 00:10:04,492 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 830 transitions. Word has length 58 [2021-12-07 00:10:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:04,492 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 830 transitions. [2021-12-07 00:10:04,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 830 transitions. [2021-12-07 00:10:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 00:10:04,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:04,494 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] [2021-12-07 00:10:04,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:10:04,495 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:04,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1199060741, now seen corresponding path program 1 times [2021-12-07 00:10:04,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:04,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745528014] [2021-12-07 00:10:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:04,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:04,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:04,586 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-07 00:10:04,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:04,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745528014] [2021-12-07 00:10:04,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745528014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:04,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:04,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:10:04,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191840014] [2021-12-07 00:10:04,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:04,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:10:04,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:04,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:10:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:10:04,588 INFO L87 Difference]: Start difference. First operand 581 states and 830 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:04,950 INFO L93 Difference]: Finished difference Result 1198 states and 1742 transitions. [2021-12-07 00:10:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:10:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-07 00:10:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:04,955 INFO L225 Difference]: With dead ends: 1198 [2021-12-07 00:10:04,956 INFO L226 Difference]: Without dead ends: 739 [2021-12-07 00:10:04,958 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-07 00:10:04,959 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 286 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:04,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 1197 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:10:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-12-07 00:10:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 596. [2021-12-07 00:10:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 482 states have (on average 1.4398340248962656) internal successors, (694), 491 states have internal predecessors, (694), 71 states have call successors, (71), 39 states have call predecessors, (71), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2021-12-07 00:10:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2021-12-07 00:10:05,020 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 58 [2021-12-07 00:10:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:05,020 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2021-12-07 00:10:05,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2021-12-07 00:10:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-07 00:10:05,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:05,023 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] [2021-12-07 00:10:05,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:10:05,023 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1044922557, now seen corresponding path program 1 times [2021-12-07 00:10:05,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:05,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363564501] [2021-12-07 00:10:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:05,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:05,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:05,115 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-07 00:10:05,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:05,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363564501] [2021-12-07 00:10:05,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363564501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:05,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:05,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:10:05,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255325886] [2021-12-07 00:10:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:05,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:10:05,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:10:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:10:05,117 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:05,863 INFO L93 Difference]: Finished difference Result 2484 states and 3624 transitions. [2021-12-07 00:10:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 00:10:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-07 00:10:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:05,878 INFO L225 Difference]: With dead ends: 2484 [2021-12-07 00:10:05,878 INFO L226 Difference]: Without dead ends: 2010 [2021-12-07 00:10:05,881 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-07 00:10:05,883 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 1007 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:05,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 1112 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 00:10:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2021-12-07 00:10:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1755. [2021-12-07 00:10:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1398 states have (on average 1.3876967095851216) internal successors, (1940), 1434 states have internal predecessors, (1940), 212 states have call successors, (212), 129 states have call predecessors, (212), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2021-12-07 00:10:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2457 transitions. [2021-12-07 00:10:05,970 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2457 transitions. Word has length 58 [2021-12-07 00:10:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:05,970 INFO L470 AbstractCegarLoop]: Abstraction has 1755 states and 2457 transitions. [2021-12-07 00:10:05,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 00:10:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2457 transitions. [2021-12-07 00:10:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-07 00:10:05,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:05,972 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-07 00:10:05,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:10:05,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:05,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash 863362558, now seen corresponding path program 1 times [2021-12-07 00:10:05,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:05,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173297417] [2021-12-07 00:10:05,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:05,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:05,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:10:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:10:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:10:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,036 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-07 00:10:06,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173297417] [2021-12-07 00:10:06,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173297417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:06,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:06,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:10:06,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676070598] [2021-12-07 00:10:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:06,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:10:06,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:06,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:10:06,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:06,038 INFO L87 Difference]: Start difference. First operand 1755 states and 2457 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-07 00:10:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:06,483 INFO L93 Difference]: Finished difference Result 2010 states and 2827 transitions. [2021-12-07 00:10:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 00:10:06,484 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-07 00:10:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:06,497 INFO L225 Difference]: With dead ends: 2010 [2021-12-07 00:10:06,497 INFO L226 Difference]: Without dead ends: 1906 [2021-12-07 00:10:06,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-07 00:10:06,506 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 469 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:06,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 1092 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:10:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2021-12-07 00:10:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1867. [2021-12-07 00:10:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1488 states have (on average 1.3891129032258065) internal successors, (2067), 1526 states have internal predecessors, (2067), 225 states have call successors, (225), 136 states have call predecessors, (225), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2021-12-07 00:10:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2615 transitions. [2021-12-07 00:10:06,603 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2615 transitions. Word has length 65 [2021-12-07 00:10:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:06,604 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 2615 transitions. [2021-12-07 00:10:06,604 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-07 00:10:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2615 transitions. [2021-12-07 00:10:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-07 00:10:06,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:06,606 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-07 00:10:06,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:10:06,606 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1752716098, now seen corresponding path program 1 times [2021-12-07 00:10:06,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:06,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112574243] [2021-12-07 00:10:06,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:06,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:10:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:10:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:10:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:06,681 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-07 00:10:06,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:06,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112574243] [2021-12-07 00:10:06,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112574243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:06,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:06,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:10:06,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847380311] [2021-12-07 00:10:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:06,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:10:06,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:10:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:06,683 INFO L87 Difference]: Start difference. First operand 1867 states and 2615 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-07 00:10:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:07,202 INFO L93 Difference]: Finished difference Result 2264 states and 3181 transitions. [2021-12-07 00:10:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:10:07,202 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-07 00:10:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:07,215 INFO L225 Difference]: With dead ends: 2264 [2021-12-07 00:10:07,216 INFO L226 Difference]: Without dead ends: 2055 [2021-12-07 00:10:07,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-07 00:10:07,218 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 608 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:07,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1279 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 00:10:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2021-12-07 00:10:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1979. [2021-12-07 00:10:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1578 states have (on average 1.3897338403041826) internal successors, (2193), 1618 states have internal predecessors, (2193), 238 states have call successors, (238), 143 states have call predecessors, (238), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2021-12-07 00:10:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 2775 transitions. [2021-12-07 00:10:07,313 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 2775 transitions. Word has length 65 [2021-12-07 00:10:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:07,314 INFO L470 AbstractCegarLoop]: Abstraction has 1979 states and 2775 transitions. [2021-12-07 00:10:07,314 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-07 00:10:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2775 transitions. [2021-12-07 00:10:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-07 00:10:07,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:07,316 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-07 00:10:07,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:10:07,316 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash 513665088, now seen corresponding path program 1 times [2021-12-07 00:10:07,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:07,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605214500] [2021-12-07 00:10:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:07,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:10:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:10:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:10:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:07,389 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-07 00:10:07,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:07,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605214500] [2021-12-07 00:10:07,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605214500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:07,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:07,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:10:07,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788794596] [2021-12-07 00:10:07,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:07,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:10:07,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:07,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:10:07,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:10:07,390 INFO L87 Difference]: Start difference. First operand 1979 states and 2775 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-07 00:10:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:08,311 INFO L93 Difference]: Finished difference Result 3525 states and 4973 transitions. [2021-12-07 00:10:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-07 00:10:08,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2021-12-07 00:10:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:08,326 INFO L225 Difference]: With dead ends: 3525 [2021-12-07 00:10:08,326 INFO L226 Difference]: Without dead ends: 3192 [2021-12-07 00:10:08,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-07 00:10:08,329 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 2184 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:08,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2206 Valid, 1613 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-07 00:10:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2021-12-07 00:10:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3032. [2021-12-07 00:10:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 2426 states have (on average 1.375515251442704) internal successors, (3337), 2481 states have internal predecessors, (3337), 348 states have call successors, (348), 226 states have call predecessors, (348), 256 states have return successors, (477), 330 states have call predecessors, (477), 344 states have call successors, (477) [2021-12-07 00:10:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 4162 transitions. [2021-12-07 00:10:08,480 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 4162 transitions. Word has length 65 [2021-12-07 00:10:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:08,480 INFO L470 AbstractCegarLoop]: Abstraction has 3032 states and 4162 transitions. [2021-12-07 00:10:08,480 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-07 00:10:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4162 transitions. [2021-12-07 00:10:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-07 00:10:08,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:08,482 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-07 00:10:08,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 00:10:08,483 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2024207263, now seen corresponding path program 1 times [2021-12-07 00:10:08,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:08,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307391421] [2021-12-07 00:10:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:08,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:10:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-07 00:10:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:08,583 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-07 00:10:08,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307391421] [2021-12-07 00:10:08,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307391421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:08,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:08,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:10:08,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81905181] [2021-12-07 00:10:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:08,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:10:08,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:10:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:10:08,584 INFO L87 Difference]: Start difference. First operand 3032 states and 4162 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-07 00:10:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:09,023 INFO L93 Difference]: Finished difference Result 4560 states and 6241 transitions. [2021-12-07 00:10:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:10:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2021-12-07 00:10:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:09,037 INFO L225 Difference]: With dead ends: 4560 [2021-12-07 00:10:09,037 INFO L226 Difference]: Without dead ends: 3180 [2021-12-07 00:10:09,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-07 00:10:09,041 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 229 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:09,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 1550 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:10:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2021-12-07 00:10:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3072. [2021-12-07 00:10:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 2458 states have (on average 1.368185516680228) internal successors, (3363), 2513 states have internal predecessors, (3363), 348 states have call successors, (348), 226 states have call predecessors, (348), 264 states have return successors, (485), 338 states have call predecessors, (485), 344 states have call successors, (485) [2021-12-07 00:10:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4196 transitions. [2021-12-07 00:10:09,184 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4196 transitions. Word has length 66 [2021-12-07 00:10:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:09,184 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4196 transitions. [2021-12-07 00:10:09,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-07 00:10:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4196 transitions. [2021-12-07 00:10:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-07 00:10:09,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:09,186 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-07 00:10:09,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 00:10:09,186 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash 994847965, now seen corresponding path program 1 times [2021-12-07 00:10:09,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:09,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651257762] [2021-12-07 00:10:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:09,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:10:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-07 00:10:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:09,253 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-07 00:10:09,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:09,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651257762] [2021-12-07 00:10:09,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651257762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:09,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:09,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 00:10:09,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243334976] [2021-12-07 00:10:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:09,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 00:10:09,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:10:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:10:09,254 INFO L87 Difference]: Start difference. First operand 3072 states and 4196 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-07 00:10:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:10,188 INFO L93 Difference]: Finished difference Result 6644 states and 9070 transitions. [2021-12-07 00:10:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-07 00:10:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2021-12-07 00:10:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:10,212 INFO L225 Difference]: With dead ends: 6644 [2021-12-07 00:10:10,212 INFO L226 Difference]: Without dead ends: 3463 [2021-12-07 00:10:10,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-07 00:10:10,220 INFO L933 BasicCegarLoop]: 442 mSDtfsCounter, 2271 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:10,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2293 Valid, 1649 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-07 00:10:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2021-12-07 00:10:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3283. [2021-12-07 00:10:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3283 states, 2597 states have (on average 1.3434732383519445) internal successors, (3489), 2654 states have internal predecessors, (3489), 388 states have call successors, (388), 254 states have call predecessors, (388), 296 states have return successors, (531), 380 states have call predecessors, (531), 384 states have call successors, (531) [2021-12-07 00:10:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 3283 states and 4408 transitions. [2021-12-07 00:10:10,389 INFO L78 Accepts]: Start accepts. Automaton has 3283 states and 4408 transitions. Word has length 66 [2021-12-07 00:10:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:10,389 INFO L470 AbstractCegarLoop]: Abstraction has 3283 states and 4408 transitions. [2021-12-07 00:10:10,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-07 00:10:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3283 states and 4408 transitions. [2021-12-07 00:10:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-07 00:10:10,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:10,392 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:10,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 00:10:10,393 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 457439213, now seen corresponding path program 1 times [2021-12-07 00:10:10,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:10,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086918714] [2021-12-07 00:10:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:10,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 00:10:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-07 00:10:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:10:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-07 00:10:10,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:10,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086918714] [2021-12-07 00:10:10,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086918714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:10,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:10,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:10:10,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467330685] [2021-12-07 00:10:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:10,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:10:10,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:10:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:10:10,484 INFO L87 Difference]: Start difference. First operand 3283 states and 4408 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-07 00:10:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:10,876 INFO L93 Difference]: Finished difference Result 5108 states and 6810 transitions. [2021-12-07 00:10:10,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:10:10,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2021-12-07 00:10:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:10,891 INFO L225 Difference]: With dead ends: 5108 [2021-12-07 00:10:10,891 INFO L226 Difference]: Without dead ends: 3477 [2021-12-07 00:10:10,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 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-07 00:10:10,895 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 324 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:10,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 1341 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:10:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2021-12-07 00:10:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3343. [2021-12-07 00:10:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3343 states, 2645 states have (on average 1.3349716446124764) internal successors, (3531), 2702 states have internal predecessors, (3531), 388 states have call successors, (388), 254 states have call predecessors, (388), 308 states have return successors, (543), 392 states have call predecessors, (543), 384 states have call successors, (543) [2021-12-07 00:10:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 3343 states and 4462 transitions. [2021-12-07 00:10:11,061 INFO L78 Accepts]: Start accepts. Automaton has 3343 states and 4462 transitions. Word has length 91 [2021-12-07 00:10:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:11,061 INFO L470 AbstractCegarLoop]: Abstraction has 3343 states and 4462 transitions. [2021-12-07 00:10:11,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-07 00:10:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3343 states and 4462 transitions. [2021-12-07 00:10:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-07 00:10:11,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:11,064 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:11,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 00:10:11,064 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 901339887, now seen corresponding path program 1 times [2021-12-07 00:10:11,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:11,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47268071] [2021-12-07 00:10:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:11,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 00:10:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-07 00:10:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:10:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 00:10:11,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47268071] [2021-12-07 00:10:11,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47268071] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:11,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:11,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 00:10:11,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277177208] [2021-12-07 00:10:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:11,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 00:10:11,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 00:10:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:10:11,126 INFO L87 Difference]: Start difference. First operand 3343 states and 4462 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-07 00:10:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:11,568 INFO L93 Difference]: Finished difference Result 6940 states and 9170 transitions. [2021-12-07 00:10:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:10:11,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2021-12-07 00:10:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:11,592 INFO L225 Difference]: With dead ends: 6940 [2021-12-07 00:10:11,592 INFO L226 Difference]: Without dead ends: 5250 [2021-12-07 00:10:11,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-07 00:10:11,597 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 661 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:11,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [683 Valid, 863 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:10:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2021-12-07 00:10:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5030. [2021-12-07 00:10:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5030 states, 3959 states have (on average 1.305380146501642) internal successors, (5168), 4050 states have internal predecessors, (5168), 577 states have call successors, (577), 386 states have call predecessors, (577), 492 states have return successors, (875), 601 states have call predecessors, (875), 573 states have call successors, (875) [2021-12-07 00:10:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 6620 transitions. [2021-12-07 00:10:11,816 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 6620 transitions. Word has length 91 [2021-12-07 00:10:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:11,817 INFO L470 AbstractCegarLoop]: Abstraction has 5030 states and 6620 transitions. [2021-12-07 00:10:11,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-07 00:10:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 6620 transitions. [2021-12-07 00:10:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-07 00:10:11,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:11,820 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:11,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 00:10:11,820 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -156498191, now seen corresponding path program 1 times [2021-12-07 00:10:11,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:11,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166321560] [2021-12-07 00:10:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:11,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 00:10:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-07 00:10:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 00:10:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-07 00:10:11,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166321560] [2021-12-07 00:10:11,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166321560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:11,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:11,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:10:11,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486909551] [2021-12-07 00:10:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:11,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:10:11,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:10:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:10:11,874 INFO L87 Difference]: Start difference. First operand 5030 states and 6620 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 00:10:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:12,175 INFO L93 Difference]: Finished difference Result 6838 states and 8888 transitions. [2021-12-07 00:10:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 00:10:12,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2021-12-07 00:10:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:12,187 INFO L225 Difference]: With dead ends: 6838 [2021-12-07 00:10:12,187 INFO L226 Difference]: Without dead ends: 3461 [2021-12-07 00:10:12,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-07 00:10:12,194 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 338 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:12,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 784 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:10:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2021-12-07 00:10:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3343. [2021-12-07 00:10:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3343 states, 2645 states have (on average 1.3187145557655955) internal successors, (3488), 2702 states have internal predecessors, (3488), 388 states have call successors, (388), 254 states have call predecessors, (388), 308 states have return successors, (543), 392 states have call predecessors, (543), 384 states have call successors, (543) [2021-12-07 00:10:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 3343 states and 4419 transitions. [2021-12-07 00:10:12,383 INFO L78 Accepts]: Start accepts. Automaton has 3343 states and 4419 transitions. Word has length 91 [2021-12-07 00:10:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:12,383 INFO L470 AbstractCegarLoop]: Abstraction has 3343 states and 4419 transitions. [2021-12-07 00:10:12,383 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), 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-07 00:10:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3343 states and 4419 transitions. [2021-12-07 00:10:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-07 00:10:12,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:12,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:12,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 00:10:12,387 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash 435090271, now seen corresponding path program 1 times [2021-12-07 00:10:12,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:12,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931100360] [2021-12-07 00:10:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:12,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:10:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:10:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:10:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 00:10:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-07 00:10:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-07 00:10:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 00:10:12,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:12,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931100360] [2021-12-07 00:10:12,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931100360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:12,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:12,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:10:12,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068769797] [2021-12-07 00:10:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:12,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:10:12,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:10:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:10:12,451 INFO L87 Difference]: Start difference. First operand 3343 states and 4419 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-07 00:10:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:13,264 INFO L93 Difference]: Finished difference Result 6152 states and 7998 transitions. [2021-12-07 00:10:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-07 00:10:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2021-12-07 00:10:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:13,277 INFO L225 Difference]: With dead ends: 6152 [2021-12-07 00:10:13,277 INFO L226 Difference]: Without dead ends: 4157 [2021-12-07 00:10:13,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-07 00:10:13,282 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 1231 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:13,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 1403 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 00:10:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2021-12-07 00:10:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 3980. [2021-12-07 00:10:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3123 states have (on average 1.2910662824207493) internal successors, (4032), 3189 states have internal predecessors, (4032), 467 states have call successors, (467), 303 states have call predecessors, (467), 388 states have return successors, (679), 493 states have call predecessors, (679), 463 states have call successors, (679) [2021-12-07 00:10:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 5178 transitions. [2021-12-07 00:10:13,459 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 5178 transitions. Word has length 92 [2021-12-07 00:10:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:13,459 INFO L470 AbstractCegarLoop]: Abstraction has 3980 states and 5178 transitions. [2021-12-07 00:10:13,459 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-07 00:10:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 5178 transitions. [2021-12-07 00:10:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-07 00:10:13,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:13,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:10:13,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 00:10:13,462 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1866213314, now seen corresponding path program 1 times [2021-12-07 00:10:13,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:13,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858620028] [2021-12-07 00:10:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:13,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-07 00:10:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 00:10:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-07 00:10:13,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858620028] [2021-12-07 00:10:13,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858620028] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580926715] [2021-12-07 00:10:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:13,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:13,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:13,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 00:10:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:13,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:10:13,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-07 00:10:13,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:13,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580926715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:13,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:13,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-07 00:10:13,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722823680] [2021-12-07 00:10:13,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:13,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:10:13,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:13,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:10:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:13,697 INFO L87 Difference]: Start difference. First operand 3980 states and 5178 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:13,935 INFO L93 Difference]: Finished difference Result 7049 states and 9499 transitions. [2021-12-07 00:10:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:10:13,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-07 00:10:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:13,946 INFO L225 Difference]: With dead ends: 7049 [2021-12-07 00:10:13,946 INFO L226 Difference]: Without dead ends: 4373 [2021-12-07 00:10:13,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:13,953 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 114 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 706 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-07 00:10:13,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 706 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:10:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2021-12-07 00:10:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2021-12-07 00:10:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4373 states, 3442 states have (on average 1.295758280069727) internal successors, (4460), 3512 states have internal predecessors, (4460), 509 states have call successors, (509), 331 states have call predecessors, (509), 420 states have return successors, (743), 535 states have call predecessors, (743), 505 states have call successors, (743) [2021-12-07 00:10:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 5712 transitions. [2021-12-07 00:10:14,175 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 5712 transitions. Word has length 93 [2021-12-07 00:10:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:14,176 INFO L470 AbstractCegarLoop]: Abstraction has 4373 states and 5712 transitions. [2021-12-07 00:10:14,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 5712 transitions. [2021-12-07 00:10:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-07 00:10:14,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:14,182 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:14,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 00:10:14,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-07 00:10:14,382 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash -287830492, now seen corresponding path program 1 times [2021-12-07 00:10:14,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:14,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718465098] [2021-12-07 00:10:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:14,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-07 00:10:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-07 00:10:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-07 00:10:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-07 00:10:14,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:14,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718465098] [2021-12-07 00:10:14,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718465098] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:14,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319281951] [2021-12-07 00:10:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:14,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:14,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:14,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 00:10:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:14,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:10:14,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-07 00:10:14,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:14,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319281951] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:14,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:14,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-07 00:10:14,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082160253] [2021-12-07 00:10:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:14,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:10:14,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:10:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:14,680 INFO L87 Difference]: Start difference. First operand 4373 states and 5712 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-07 00:10:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:14,894 INFO L93 Difference]: Finished difference Result 7227 states and 9755 transitions. [2021-12-07 00:10:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:10:14,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-07 00:10:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:14,907 INFO L225 Difference]: With dead ends: 7227 [2021-12-07 00:10:14,907 INFO L226 Difference]: Without dead ends: 5582 [2021-12-07 00:10:14,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:14,916 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 224 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 459 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-07 00:10:14,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 459 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:10:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5582 states. [2021-12-07 00:10:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5582 to 5538. [2021-12-07 00:10:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5538 states, 4382 states have (on average 1.312186216339571) internal successors, (5750), 4469 states have internal predecessors, (5750), 637 states have call successors, (637), 416 states have call predecessors, (637), 517 states have return successors, (923), 658 states have call predecessors, (923), 633 states have call successors, (923) [2021-12-07 00:10:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 7310 transitions. [2021-12-07 00:10:15,195 INFO L78 Accepts]: Start accepts. Automaton has 5538 states and 7310 transitions. Word has length 119 [2021-12-07 00:10:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:15,195 INFO L470 AbstractCegarLoop]: Abstraction has 5538 states and 7310 transitions. [2021-12-07 00:10:15,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-07 00:10:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5538 states and 7310 transitions. [2021-12-07 00:10:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-07 00:10:15,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:15,200 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:15,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 00:10:15,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-07 00:10:15,401 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1068470771, now seen corresponding path program 1 times [2021-12-07 00:10:15,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:15,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933289217] [2021-12-07 00:10:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:15,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 00:10:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-07 00:10:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-07 00:10:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-07 00:10:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-07 00:10:15,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:15,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933289217] [2021-12-07 00:10:15,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933289217] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:15,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814383914] [2021-12-07 00:10:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:15,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:15,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:15,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 00:10:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:15,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:10:15,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-07 00:10:15,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:15,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814383914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:15,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:15,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-07 00:10:15,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701569804] [2021-12-07 00:10:15,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:15,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:10:15,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:15,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:10:15,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:15,650 INFO L87 Difference]: Start difference. First operand 5538 states and 7310 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-07 00:10:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:15,864 INFO L93 Difference]: Finished difference Result 9224 states and 12488 transitions. [2021-12-07 00:10:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:10:15,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2021-12-07 00:10:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:15,877 INFO L225 Difference]: With dead ends: 9224 [2021-12-07 00:10:15,877 INFO L226 Difference]: Without dead ends: 6032 [2021-12-07 00:10:15,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:15,888 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 275 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 322 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-07 00:10:15,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 322 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:10:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2021-12-07 00:10:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 5922. [2021-12-07 00:10:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5922 states, 4741 states have (on average 1.2731491246572453) internal successors, (6036), 4823 states have internal predecessors, (6036), 633 states have call successors, (633), 442 states have call predecessors, (633), 546 states have return successors, (905), 662 states have call predecessors, (905), 629 states have call successors, (905) [2021-12-07 00:10:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 7574 transitions. [2021-12-07 00:10:16,157 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 7574 transitions. Word has length 135 [2021-12-07 00:10:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:16,157 INFO L470 AbstractCegarLoop]: Abstraction has 5922 states and 7574 transitions. [2021-12-07 00:10:16,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-07 00:10:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 7574 transitions. [2021-12-07 00:10:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-07 00:10:16,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:16,162 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:16,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 00:10:16,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-07 00:10:16,363 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1809607182, now seen corresponding path program 1 times [2021-12-07 00:10:16,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:16,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739694081] [2021-12-07 00:10:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:16,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 00:10:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-07 00:10:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-07 00:10:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-07 00:10:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-07 00:10:16,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739694081] [2021-12-07 00:10:16,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739694081] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021243144] [2021-12-07 00:10:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:16,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:16,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:16,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:16,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 00:10:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:16,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:10:16,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-07 00:10:16,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:16,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021243144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:16,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:16,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-07 00:10:16,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517602984] [2021-12-07 00:10:16,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:16,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:10:16,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:10:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:16,604 INFO L87 Difference]: Start difference. First operand 5922 states and 7574 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-07 00:10:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:16,877 INFO L93 Difference]: Finished difference Result 9581 states and 12415 transitions. [2021-12-07 00:10:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:10:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2021-12-07 00:10:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:16,889 INFO L225 Difference]: With dead ends: 9581 [2021-12-07 00:10:16,890 INFO L226 Difference]: Without dead ends: 6007 [2021-12-07 00:10:16,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:16,897 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 263 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 446 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-07 00:10:16,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 446 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:10:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2021-12-07 00:10:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 5892. [2021-12-07 00:10:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5892 states, 4711 states have (on average 1.2557843345361919) internal successors, (5916), 4793 states have internal predecessors, (5916), 633 states have call successors, (633), 442 states have call predecessors, (633), 546 states have return successors, (905), 662 states have call predecessors, (905), 629 states have call successors, (905) [2021-12-07 00:10:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 7454 transitions. [2021-12-07 00:10:17,170 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 7454 transitions. Word has length 135 [2021-12-07 00:10:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:17,170 INFO L470 AbstractCegarLoop]: Abstraction has 5892 states and 7454 transitions. [2021-12-07 00:10:17,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-07 00:10:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 7454 transitions. [2021-12-07 00:10:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-07 00:10:17,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:17,174 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:17,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 00:10:17,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-07 00:10:17,376 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1867127916, now seen corresponding path program 1 times [2021-12-07 00:10:17,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:17,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903934383] [2021-12-07 00:10:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:17,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 00:10:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 00:10:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 00:10:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-07 00:10:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-07 00:10:17,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:17,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903934383] [2021-12-07 00:10:17,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903934383] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:17,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163775850] [2021-12-07 00:10:17,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:17,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:17,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:17,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:17,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 00:10:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:17,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 00:10:17,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-07 00:10:17,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:17,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163775850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:17,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:17,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-07 00:10:17,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280882361] [2021-12-07 00:10:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:17,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:10:17,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:10:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:17,717 INFO L87 Difference]: Start difference. First operand 5892 states and 7454 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-07 00:10:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:17,919 INFO L93 Difference]: Finished difference Result 7397 states and 9498 transitions. [2021-12-07 00:10:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:10:17,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-07 00:10:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:17,928 INFO L225 Difference]: With dead ends: 7397 [2021-12-07 00:10:17,928 INFO L226 Difference]: Without dead ends: 5613 [2021-12-07 00:10:17,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:10:17,932 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 88 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 680 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-07 00:10:17,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 680 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:10:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2021-12-07 00:10:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 5549. [2021-12-07 00:10:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5549 states, 4436 states have (on average 1.243688007213706) internal successors, (5517), 4514 states have internal predecessors, (5517), 597 states have call successors, (597), 417 states have call predecessors, (597), 514 states have return successors, (841), 623 states have call predecessors, (841), 593 states have call successors, (841) [2021-12-07 00:10:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 6955 transitions. [2021-12-07 00:10:18,162 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 6955 transitions. Word has length 136 [2021-12-07 00:10:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:18,163 INFO L470 AbstractCegarLoop]: Abstraction has 5549 states and 6955 transitions. [2021-12-07 00:10:18,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-07 00:10:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 6955 transitions. [2021-12-07 00:10:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-07 00:10:18,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:18,167 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:18,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 00:10:18,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:18,369 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash -895196586, now seen corresponding path program 1 times [2021-12-07 00:10:18,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:18,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271757896] [2021-12-07 00:10:18,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:18,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 00:10:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 00:10:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 00:10:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-07 00:10:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-07 00:10:18,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:18,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271757896] [2021-12-07 00:10:18,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271757896] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:18,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371499121] [2021-12-07 00:10:18,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:18,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:18,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:18,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 00:10:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:18,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:10:18,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-07 00:10:18,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:18,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371499121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:18,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:18,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-07 00:10:18,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387731800] [2021-12-07 00:10:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:18,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:10:18,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:10:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:10:18,653 INFO L87 Difference]: Start difference. First operand 5549 states and 6955 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:18,984 INFO L93 Difference]: Finished difference Result 6907 states and 8730 transitions. [2021-12-07 00:10:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:10:18,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-07 00:10:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:18,994 INFO L225 Difference]: With dead ends: 6907 [2021-12-07 00:10:18,994 INFO L226 Difference]: Without dead ends: 4917 [2021-12-07 00:10:18,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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-07 00:10:18,999 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 332 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:18,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 535 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:10:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2021-12-07 00:10:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4896. [2021-12-07 00:10:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 3901 states have (on average 1.2243014611638041) internal successors, (4776), 3962 states have internal predecessors, (4776), 538 states have call successors, (538), 372 states have call predecessors, (538), 455 states have return successors, (723), 565 states have call predecessors, (723), 534 states have call successors, (723) [2021-12-07 00:10:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6037 transitions. [2021-12-07 00:10:19,252 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6037 transitions. Word has length 137 [2021-12-07 00:10:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:19,253 INFO L470 AbstractCegarLoop]: Abstraction has 4896 states and 6037 transitions. [2021-12-07 00:10:19,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6037 transitions. [2021-12-07 00:10:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-07 00:10:19,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:19,256 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:19,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 00:10:19,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:19,458 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1533062036, now seen corresponding path program 1 times [2021-12-07 00:10:19,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:19,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462867887] [2021-12-07 00:10:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:19,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 00:10:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 00:10:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 00:10:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-07 00:10:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-07 00:10:19,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462867887] [2021-12-07 00:10:19,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462867887] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108580847] [2021-12-07 00:10:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:19,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:19,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:19,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:19,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 00:10:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:19,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:10:19,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-07 00:10:19,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:19,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108580847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:19,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:19,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-07 00:10:19,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974908929] [2021-12-07 00:10:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:19,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:10:19,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:10:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:10:19,743 INFO L87 Difference]: Start difference. First operand 4896 states and 6037 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:20,061 INFO L93 Difference]: Finished difference Result 6532 states and 8065 transitions. [2021-12-07 00:10:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:10:20,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-07 00:10:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:20,068 INFO L225 Difference]: With dead ends: 6532 [2021-12-07 00:10:20,068 INFO L226 Difference]: Without dead ends: 4065 [2021-12-07 00:10:20,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-07 00:10:20,074 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 351 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:20,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 543 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 00:10:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2021-12-07 00:10:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3546. [2021-12-07 00:10:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3546 states, 2805 states have (on average 1.202139037433155) internal successors, (3372), 2850 states have internal predecessors, (3372), 392 states have call successors, (392), 269 states have call predecessors, (392), 347 states have return successors, (531), 429 states have call predecessors, (531), 388 states have call successors, (531) [2021-12-07 00:10:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4295 transitions. [2021-12-07 00:10:20,253 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4295 transitions. Word has length 137 [2021-12-07 00:10:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:20,253 INFO L470 AbstractCegarLoop]: Abstraction has 3546 states and 4295 transitions. [2021-12-07 00:10:20,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4295 transitions. [2021-12-07 00:10:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-07 00:10:20,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:20,256 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:20,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 00:10:20,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:20,457 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash 225919638, now seen corresponding path program 1 times [2021-12-07 00:10:20,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:20,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575337922] [2021-12-07 00:10:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:20,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 00:10:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 00:10:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 00:10:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-07 00:10:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-07 00:10:20,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:20,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575337922] [2021-12-07 00:10:20,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575337922] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:10:20,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871518676] [2021-12-07 00:10:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:20,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:10:20,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:10:20,560 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:10:20,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 00:10:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:20,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:10:20,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:10:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-07 00:10:20,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:10:20,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871518676] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:20,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:10:20,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-07 00:10:20,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322200246] [2021-12-07 00:10:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:20,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:10:20,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:10:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 00:10:20,736 INFO L87 Difference]: Start difference. First operand 3546 states and 4295 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:20,934 INFO L93 Difference]: Finished difference Result 4780 states and 5804 transitions. [2021-12-07 00:10:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:10:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-07 00:10:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:20,940 INFO L225 Difference]: With dead ends: 4780 [2021-12-07 00:10:20,941 INFO L226 Difference]: Without dead ends: 3581 [2021-12-07 00:10:20,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 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-07 00:10:20,944 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 10 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1151 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-07 00:10:20,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1151 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:10:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2021-12-07 00:10:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3561. [2021-12-07 00:10:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3561 states, 2820 states have (on average 1.1932624113475176) internal successors, (3365), 2865 states have internal predecessors, (3365), 392 states have call successors, (392), 269 states have call predecessors, (392), 347 states have return successors, (531), 429 states have call predecessors, (531), 388 states have call successors, (531) [2021-12-07 00:10:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 4288 transitions. [2021-12-07 00:10:21,120 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 4288 transitions. Word has length 137 [2021-12-07 00:10:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:21,121 INFO L470 AbstractCegarLoop]: Abstraction has 3561 states and 4288 transitions. [2021-12-07 00:10:21,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4288 transitions. [2021-12-07 00:10:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-07 00:10:21,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:21,123 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:21,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-07 00:10:21,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-07 00:10:21,325 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1775392230, now seen corresponding path program 1 times [2021-12-07 00:10:21,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:21,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075848697] [2021-12-07 00:10:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:21,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 00:10:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 00:10:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 00:10:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-07 00:10:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-07 00:10:21,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:21,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075848697] [2021-12-07 00:10:21,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075848697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:21,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:21,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 00:10:21,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217250086] [2021-12-07 00:10:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:21,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 00:10:21,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 00:10:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:10:21,407 INFO L87 Difference]: Start difference. First operand 3561 states and 4288 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 00:10:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:21,953 INFO L93 Difference]: Finished difference Result 4543 states and 5391 transitions. [2021-12-07 00:10:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 00:10:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-07 00:10:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:21,961 INFO L225 Difference]: With dead ends: 4543 [2021-12-07 00:10:21,961 INFO L226 Difference]: Without dead ends: 4540 [2021-12-07 00:10:21,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-07 00:10:21,963 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 727 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:21,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 861 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:10:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2021-12-07 00:10:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4265. [2021-12-07 00:10:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4265 states, 3400 states have (on average 1.1808823529411765) internal successors, (4015), 3451 states have internal predecessors, (4015), 460 states have call successors, (460), 317 states have call predecessors, (460), 403 states have return successors, (610), 499 states have call predecessors, (610), 456 states have call successors, (610) [2021-12-07 00:10:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 5085 transitions. [2021-12-07 00:10:22,183 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 5085 transitions. Word has length 137 [2021-12-07 00:10:22,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:22,183 INFO L470 AbstractCegarLoop]: Abstraction has 4265 states and 5085 transitions. [2021-12-07 00:10:22,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 00:10:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 5085 transitions. [2021-12-07 00:10:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-07 00:10:22,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:22,187 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:22,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-07 00:10:22,187 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1319300478, now seen corresponding path program 1 times [2021-12-07 00:10:22,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:22,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076136168] [2021-12-07 00:10:22,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:22,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:10:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-07 00:10:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:10:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 00:10:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 00:10:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 00:10:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 00:10:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 00:10:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 00:10:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-07 00:10:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:10:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-07 00:10:22,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:10:22,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076136168] [2021-12-07 00:10:22,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076136168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:10:22,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:10:22,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:10:22,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663145107] [2021-12-07 00:10:22,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:10:22,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:10:22,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:10:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:10:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:10:22,243 INFO L87 Difference]: Start difference. First operand 4265 states and 5085 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:10:22,632 INFO L93 Difference]: Finished difference Result 6024 states and 7243 transitions. [2021-12-07 00:10:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 00:10:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-07 00:10:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:10:22,640 INFO L225 Difference]: With dead ends: 6024 [2021-12-07 00:10:22,640 INFO L226 Difference]: Without dead ends: 4786 [2021-12-07 00:10:22,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 00:10:22,644 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 252 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:10:22,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 834 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:10:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2021-12-07 00:10:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4267. [2021-12-07 00:10:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3402 states have (on average 1.1807760141093475) internal successors, (4017), 3453 states have internal predecessors, (4017), 460 states have call successors, (460), 317 states have call predecessors, (460), 403 states have return successors, (610), 499 states have call predecessors, (610), 456 states have call successors, (610) [2021-12-07 00:10:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 5087 transitions. [2021-12-07 00:10:22,937 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 5087 transitions. Word has length 141 [2021-12-07 00:10:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:10:22,938 INFO L470 AbstractCegarLoop]: Abstraction has 4267 states and 5087 transitions. [2021-12-07 00:10:22,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 00:10:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5087 transitions. [2021-12-07 00:10:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-07 00:10:22,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:10:22,940 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:10:22,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-07 00:10:22,941 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:10:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:10:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1014498838, now seen corresponding path program 1 times [2021-12-07 00:10:22,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:10:22,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221689832] [2021-12-07 00:10:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:10:22,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:10:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:10:22,951 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:10:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:10:23,020 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:10:23,020 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 00:10:23,021 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-07 00:10:23,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-07 00:10:23,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-07 00:10:23,025 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-07 00:10:23,028 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:10:23,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:10:23 BoogieIcfgContainer [2021-12-07 00:10:23,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:10:23,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:10:23,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:10:23,148 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:10:23,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:10:02" (3/4) ... [2021-12-07 00:10:23,150 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 00:10:23,264 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:10:23,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:10:23,265 INFO L158 Benchmark]: Toolchain (without parser) took 21785.84ms. Allocated memory was 111.1MB in the beginning and 796.9MB in the end (delta: 685.8MB). Free memory was 73.2MB in the beginning and 433.3MB in the end (delta: -360.2MB). Peak memory consumption was 326.8MB. Max. memory is 16.1GB. [2021-12-07 00:10:23,265 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:10:23,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.02ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 56.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-07 00:10:23,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.60ms. Allocated memory is still 111.1MB. Free memory was 56.1MB in the beginning and 53.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 00:10:23,266 INFO L158 Benchmark]: Boogie Preprocessor took 28.49ms. Allocated memory is still 111.1MB. Free memory was 53.3MB in the beginning and 51.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:10:23,266 INFO L158 Benchmark]: RCFGBuilder took 477.35ms. Allocated memory is still 111.1MB. Free memory was 50.9MB in the beginning and 73.3MB in the end (delta: -22.4MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2021-12-07 00:10:23,266 INFO L158 Benchmark]: TraceAbstraction took 20853.51ms. Allocated memory was 111.1MB in the beginning and 796.9MB in the end (delta: 685.8MB). Free memory was 72.8MB in the beginning and 456.4MB in the end (delta: -383.6MB). Peak memory consumption was 303.2MB. Max. memory is 16.1GB. [2021-12-07 00:10:23,267 INFO L158 Benchmark]: Witness Printer took 116.59ms. Allocated memory is still 796.9MB. Free memory was 456.4MB in the beginning and 433.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-07 00:10:23,268 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.17ms. Allocated memory is still 111.1MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.02ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 56.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.60ms. Allocated memory is still 111.1MB. Free memory was 56.1MB in the beginning and 53.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.49ms. Allocated memory is still 111.1MB. Free memory was 53.3MB in the beginning and 51.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.35ms. Allocated memory is still 111.1MB. Free memory was 50.9MB in the beginning and 73.3MB in the end (delta: -22.4MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20853.51ms. Allocated memory was 111.1MB in the beginning and 796.9MB in the end (delta: 685.8MB). Free memory was 72.8MB in the beginning and 456.4MB in the end (delta: -383.6MB). Peak memory consumption was 303.2MB. Max. memory is 16.1GB. * Witness Printer took 116.59ms. Allocated memory is still 796.9MB. Free memory was 456.4MB in the beginning and 433.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1012] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L850] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L855] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L860] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L865] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1014] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1015] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L727] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L746] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L1015] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1016] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L878] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L883] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L888] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L893] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1016] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1019] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L634] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L640] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L932] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L727] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L746] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L932] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L640] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L641] E_1 = 2 [L642] m_pc = 1 [L643] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L817] RET master() [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L682] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L698] token += 1 [L699] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L700] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L932] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L715] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L735] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L932] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L700] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L701] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L626] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L648] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L653] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L654] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L659] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L660] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L661] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L662] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L599] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: 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, 232 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14237 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13923 mSDsluCounter, 23804 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15559 mSDsCounter, 3487 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11887 IncrementalHoareTripleChecker+Invalid, 15374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3487 mSolverCounterUnsat, 8245 mSDtfsCounter, 11887 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1815 GetRequests, 1494 SyntacticMatches, 2 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5922occurred in iteration=17, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 3558 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3460 NumberOfCodeBlocks, 3460 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3286 ConstructedInterpolants, 0 QuantifiedInterpolants, 5694 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3510 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1282/1357 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-07 00:10:23,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45cbc1d9-b5cf-4235-bacc-a62015999c18/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE