./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:12:04,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:12:04,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:12:04,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:12:04,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:12:04,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:12:04,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:12:04,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:12:04,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:12:04,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:12:04,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:12:04,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:12:04,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:12:04,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:12:04,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:12:04,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:12:04,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:12:04,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:12:04,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:12:04,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:12:04,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:12:04,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:12:04,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:12:04,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:12:04,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:12:04,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:12:04,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:12:04,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:12:04,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:12:04,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:12:04,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:12:04,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:12:04,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:12:04,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:12:04,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:12:04,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:12:04,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:12:04,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:12:04,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:12:04,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:12:04,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:12:04,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:12:04,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:12:04,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:12:04,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:12:04,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:12:04,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:12:04,699 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:12:04,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:12:04,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:12:04,700 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:12:04,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:12:04,701 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:12:04,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:12:04,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:12:04,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:12:04,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:12:04,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:12:04,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:12:04,703 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:12:04,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:12:04,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:12:04,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:12:04,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:12:04,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:12:04,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:12:04,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:12:04,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:12:04,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:12:04,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:12:04,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:12:04,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:12:04,706 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:12:04,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:12:04,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:12:04,707 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_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/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_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2022-11-16 12:12:05,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:12:05,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:12:05,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:12:05,042 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:12:05,043 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:12:05,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-11-16 12:12:05,152 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/data/a3263e414/ff54c35d06ec46d298be6ffd57794142/FLAG1efdcb0ff [2022-11-16 12:12:05,681 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:12:05,682 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-11-16 12:12:05,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/data/a3263e414/ff54c35d06ec46d298be6ffd57794142/FLAG1efdcb0ff [2022-11-16 12:12:06,052 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/data/a3263e414/ff54c35d06ec46d298be6ffd57794142 [2022-11-16 12:12:06,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:12:06,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:12:06,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:12:06,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:12:06,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:12:06,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12350e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06, skipping insertion in model container [2022-11-16 12:12:06,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:12:06,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:12:06,414 WARN L229 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_7f74770c-7519-4432-9c55-f37ee5ca661f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-11-16 12:12:06,519 WARN L229 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_7f74770c-7519-4432-9c55-f37ee5ca661f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-11-16 12:12:06,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:12:06,571 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:12:06,583 WARN L229 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_7f74770c-7519-4432-9c55-f37ee5ca661f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-11-16 12:12:06,607 WARN L229 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_7f74770c-7519-4432-9c55-f37ee5ca661f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-11-16 12:12:06,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:12:06,648 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:12:06,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06 WrapperNode [2022-11-16 12:12:06,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:12:06,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:12:06,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:12:06,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:12:06,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,709 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2022-11-16 12:12:06,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:12:06,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:12:06,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:12:06,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:12:06,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,754 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:12:06,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:12:06,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:12:06,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:12:06,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (1/1) ... [2022-11-16 12:12:06,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:12:06,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:06,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:12:06,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:12:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:12:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-16 12:12:06,864 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-16 12:12:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-16 12:12:06,865 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-16 12:12:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-16 12:12:06,865 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-16 12:12:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-16 12:12:06,865 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-16 12:12:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-16 12:12:06,866 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-16 12:12:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-16 12:12:06,866 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-16 12:12:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-16 12:12:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-16 12:12:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-16 12:12:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-16 12:12:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-16 12:12:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-16 12:12:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-16 12:12:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-16 12:12:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-16 12:12:06,868 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-16 12:12:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:12:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-16 12:12:06,869 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-16 12:12:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-16 12:12:06,869 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-16 12:12:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:12:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:12:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-16 12:12:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-16 12:12:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-16 12:12:06,871 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-16 12:12:06,999 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:12:07,001 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:12:07,722 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:12:07,744 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:12:07,744 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-16 12:12:07,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:07 BoogieIcfgContainer [2022-11-16 12:12:07,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:12:07,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:12:07,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:12:07,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:12:07,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:12:06" (1/3) ... [2022-11-16 12:12:07,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a69cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:07, skipping insertion in model container [2022-11-16 12:12:07,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:06" (2/3) ... [2022-11-16 12:12:07,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a69cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:12:07, skipping insertion in model container [2022-11-16 12:12:07,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:07" (3/3) ... [2022-11-16 12:12:07,769 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-11-16 12:12:07,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:12:07,793 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:12:07,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:12:07,871 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@457e6f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:12:07,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 12:12:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-16 12:12:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:12:07,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:07,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:07,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:07,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2022-11-16 12:12:07,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:07,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203902041] [2022-11-16 12:12:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:12:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:12:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:12:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:12:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:08,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203902041] [2022-11-16 12:12:08,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203902041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:08,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:08,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:12:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899188634] [2022-11-16 12:12:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:08,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:12:08,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:12:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:12:08,592 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:09,871 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2022-11-16 12:12:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:12:09,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-16 12:12:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:09,907 INFO L225 Difference]: With dead ends: 552 [2022-11-16 12:12:09,908 INFO L226 Difference]: Without dead ends: 343 [2022-11-16 12:12:09,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:12:09,920 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 546 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:09,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 690 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:12:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-16 12:12:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2022-11-16 12:12:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-11-16 12:12:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2022-11-16 12:12:10,013 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2022-11-16 12:12:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:10,014 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2022-11-16 12:12:10,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2022-11-16 12:12:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:12:10,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:10,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:10,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:12:10,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2022-11-16 12:12:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:10,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278920212] [2022-11-16 12:12:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:10,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:12:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:12:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:12:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:10,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:12:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:10,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278920212] [2022-11-16 12:12:10,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278920212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:10,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:10,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:12:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596611911] [2022-11-16 12:12:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:10,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:12:10,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:12:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:12:10,400 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:11,471 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2022-11-16 12:12:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:12:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-16 12:12:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:11,483 INFO L225 Difference]: With dead ends: 651 [2022-11-16 12:12:11,483 INFO L226 Difference]: Without dead ends: 456 [2022-11-16 12:12:11,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:12:11,494 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 540 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:11,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 811 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:12:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-16 12:12:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2022-11-16 12:12:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-16 12:12:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2022-11-16 12:12:11,600 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2022-11-16 12:12:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:11,600 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2022-11-16 12:12:11,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2022-11-16 12:12:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:12:11,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:11,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:11,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:12:11,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2022-11-16 12:12:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:11,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776574317] [2022-11-16 12:12:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:12:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:12:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:12:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:11,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:12:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:11,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776574317] [2022-11-16 12:12:11,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776574317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:11,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:11,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:12:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640642937] [2022-11-16 12:12:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:11,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:12:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:11,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:12:11,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:12:11,817 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:13,074 INFO L93 Difference]: Finished difference Result 1002 states and 1431 transitions. [2022-11-16 12:12:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:12:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-16 12:12:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:13,081 INFO L225 Difference]: With dead ends: 1002 [2022-11-16 12:12:13,081 INFO L226 Difference]: Without dead ends: 717 [2022-11-16 12:12:13,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:12:13,084 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 549 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:13,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1002 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:12:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-11-16 12:12:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 565. [2022-11-16 12:12:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-11-16 12:12:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 804 transitions. [2022-11-16 12:12:13,150 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 804 transitions. Word has length 58 [2022-11-16 12:12:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:13,150 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 804 transitions. [2022-11-16 12:12:13,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 804 transitions. [2022-11-16 12:12:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:12:13,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:13,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:13,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:12:13,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2022-11-16 12:12:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:13,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432929121] [2022-11-16 12:12:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:12:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:13,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:12:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:12:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:12:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:13,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:13,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432929121] [2022-11-16 12:12:13,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432929121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:13,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:13,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:12:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699214627] [2022-11-16 12:12:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:13,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:12:13,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:12:13,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:12:13,411 INFO L87 Difference]: Start difference. First operand 565 states and 804 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:14,344 INFO L93 Difference]: Finished difference Result 1182 states and 1716 transitions. [2022-11-16 12:12:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:12:14,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-16 12:12:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:14,352 INFO L225 Difference]: With dead ends: 1182 [2022-11-16 12:12:14,352 INFO L226 Difference]: Without dead ends: 723 [2022-11-16 12:12:14,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:12:14,364 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 278 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:14,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 896 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:12:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-16 12:12:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 580. [2022-11-16 12:12:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-11-16 12:12:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2022-11-16 12:12:14,452 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 58 [2022-11-16 12:12:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:14,454 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2022-11-16 12:12:14,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2022-11-16 12:12:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:12:14,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:14,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:14,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:12:14,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:14,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2022-11-16 12:12:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:14,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884144352] [2022-11-16 12:12:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:14,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:12:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:12:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:12:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:14,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:12:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:14,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884144352] [2022-11-16 12:12:14,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884144352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:14,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:14,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:12:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970896568] [2022-11-16 12:12:14,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:14,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:12:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:14,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:12:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:12:14,730 INFO L87 Difference]: Start difference. First operand 580 states and 819 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:16,467 INFO L93 Difference]: Finished difference Result 2468 states and 3598 transitions. [2022-11-16 12:12:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:12:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-16 12:12:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:16,479 INFO L225 Difference]: With dead ends: 2468 [2022-11-16 12:12:16,479 INFO L226 Difference]: Without dead ends: 1994 [2022-11-16 12:12:16,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:12:16,483 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 1090 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:16,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 846 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:12:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-11-16 12:12:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1739. [2022-11-16 12:12:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-11-16 12:12:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2431 transitions. [2022-11-16 12:12:16,687 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2431 transitions. Word has length 58 [2022-11-16 12:12:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:16,687 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2431 transitions. [2022-11-16 12:12:16,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:12:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2431 transitions. [2022-11-16 12:12:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:12:16,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:16,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:16,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:12:16,690 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:16,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2022-11-16 12:12:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:16,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162294753] [2022-11-16 12:12:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162294753] [2022-11-16 12:12:16,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162294753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:16,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:16,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:12:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226961938] [2022-11-16 12:12:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:16,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:12:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:16,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:12:16,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:12:16,850 INFO L87 Difference]: Start difference. First operand 1739 states and 2431 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:17,873 INFO L93 Difference]: Finished difference Result 1962 states and 2746 transitions. [2022-11-16 12:12:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:12:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:12:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:17,884 INFO L225 Difference]: With dead ends: 1962 [2022-11-16 12:12:17,884 INFO L226 Difference]: Without dead ends: 1874 [2022-11-16 12:12:17,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:12:17,887 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 556 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:17,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 727 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:12:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-11-16 12:12:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1835. [2022-11-16 12:12:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-11-16 12:12:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2563 transitions. [2022-11-16 12:12:18,110 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2563 transitions. Word has length 65 [2022-11-16 12:12:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:18,110 INFO L495 AbstractCegarLoop]: Abstraction has 1835 states and 2563 transitions. [2022-11-16 12:12:18,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2563 transitions. [2022-11-16 12:12:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:12:18,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:18,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:18,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:12:18,113 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2022-11-16 12:12:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:18,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597797337] [2022-11-16 12:12:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:18,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597797337] [2022-11-16 12:12:18,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597797337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:18,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:18,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:12:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592177707] [2022-11-16 12:12:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:18,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:12:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:18,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:12:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:12:18,279 INFO L87 Difference]: Start difference. First operand 1835 states and 2563 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:19,491 INFO L93 Difference]: Finished difference Result 2182 states and 3040 transitions. [2022-11-16 12:12:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:12:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:12:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:19,502 INFO L225 Difference]: With dead ends: 2182 [2022-11-16 12:12:19,502 INFO L226 Difference]: Without dead ends: 2005 [2022-11-16 12:12:19,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:12:19,504 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 712 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:19,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 978 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:12:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2022-11-16 12:12:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1931. [2022-11-16 12:12:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-11-16 12:12:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2697 transitions. [2022-11-16 12:12:19,726 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2697 transitions. Word has length 65 [2022-11-16 12:12:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:19,726 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 2697 transitions. [2022-11-16 12:12:19,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2697 transitions. [2022-11-16 12:12:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:12:19,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:19,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:19,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:12:19,729 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2022-11-16 12:12:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:19,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477026808] [2022-11-16 12:12:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:19,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:19,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477026808] [2022-11-16 12:12:19,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477026808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:19,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:19,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:12:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855072830] [2022-11-16 12:12:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:19,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:12:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:19,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:12:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:12:19,923 INFO L87 Difference]: Start difference. First operand 1931 states and 2697 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:12:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:21,031 INFO L93 Difference]: Finished difference Result 2232 states and 3111 transitions. [2022-11-16 12:12:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:12:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-16 12:12:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:21,043 INFO L225 Difference]: With dead ends: 2232 [2022-11-16 12:12:21,044 INFO L226 Difference]: Without dead ends: 1965 [2022-11-16 12:12:21,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:12:21,047 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 218 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:21,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1190 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:12:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2022-11-16 12:12:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1936. [2022-11-16 12:12:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-11-16 12:12:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2700 transitions. [2022-11-16 12:12:21,296 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2700 transitions. Word has length 65 [2022-11-16 12:12:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:21,296 INFO L495 AbstractCegarLoop]: Abstraction has 1936 states and 2700 transitions. [2022-11-16 12:12:21,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:12:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2700 transitions. [2022-11-16 12:12:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:12:21,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:21,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:21,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:12:21,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2022-11-16 12:12:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:21,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467210565] [2022-11-16 12:12:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:21,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467210565] [2022-11-16 12:12:21,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467210565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:21,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:21,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:12:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943890643] [2022-11-16 12:12:21,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:21,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:12:21,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:21,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:12:21,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:12:21,535 INFO L87 Difference]: Start difference. First operand 1936 states and 2700 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:12:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:23,956 INFO L93 Difference]: Finished difference Result 3598 states and 4972 transitions. [2022-11-16 12:12:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:12:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-11-16 12:12:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:23,981 INFO L225 Difference]: With dead ends: 3598 [2022-11-16 12:12:23,981 INFO L226 Difference]: Without dead ends: 3326 [2022-11-16 12:12:23,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 12:12:23,988 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 1595 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:23,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 1157 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 12:12:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-11-16 12:12:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3076. [2022-11-16 12:12:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-11-16 12:12:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4184 transitions. [2022-11-16 12:12:24,439 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4184 transitions. Word has length 65 [2022-11-16 12:12:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:24,440 INFO L495 AbstractCegarLoop]: Abstraction has 3076 states and 4184 transitions. [2022-11-16 12:12:24,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-16 12:12:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4184 transitions. [2022-11-16 12:12:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:12:24,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:24,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:24,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:12:24,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2022-11-16 12:12:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:24,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758296649] [2022-11-16 12:12:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:24,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758296649] [2022-11-16 12:12:24,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758296649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:24,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:24,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:12:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607360089] [2022-11-16 12:12:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:12:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:12:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:12:24,634 INFO L87 Difference]: Start difference. First operand 3076 states and 4184 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:12:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:25,831 INFO L93 Difference]: Finished difference Result 4677 states and 6308 transitions. [2022-11-16 12:12:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:12:25,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-16 12:12:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:25,862 INFO L225 Difference]: With dead ends: 4677 [2022-11-16 12:12:25,862 INFO L226 Difference]: Without dead ends: 3265 [2022-11-16 12:12:25,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:12:25,867 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 216 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:25,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1189 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:12:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2022-11-16 12:12:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3121. [2022-11-16 12:12:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2476 states have (on average 1.3477382875605817) internal successors, (3337), 2536 states have internal predecessors, (3337), 349 states have call successors, (349), 245 states have call predecessors, (349), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2022-11-16 12:12:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4223 transitions. [2022-11-16 12:12:26,300 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4223 transitions. Word has length 65 [2022-11-16 12:12:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:26,300 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4223 transitions. [2022-11-16 12:12:26,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:12:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4223 transitions. [2022-11-16 12:12:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:12:26,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:26,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:26,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:12:26,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2022-11-16 12:12:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:26,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822899746] [2022-11-16 12:12:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:26,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822899746] [2022-11-16 12:12:26,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822899746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:26,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:26,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:12:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990178911] [2022-11-16 12:12:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:26,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:12:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:12:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:12:26,494 INFO L87 Difference]: Start difference. First operand 3121 states and 4223 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:27,909 INFO L93 Difference]: Finished difference Result 4556 states and 6062 transitions. [2022-11-16 12:12:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:12:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:12:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:27,928 INFO L225 Difference]: With dead ends: 4556 [2022-11-16 12:12:27,928 INFO L226 Difference]: Without dead ends: 3319 [2022-11-16 12:12:27,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:12:27,932 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 704 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:27,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 749 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:12:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2022-11-16 12:12:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3099. [2022-11-16 12:12:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2462 states have (on average 1.3456539398862712) internal successors, (3313), 2516 states have internal predecessors, (3313), 349 states have call successors, (349), 245 states have call predecessors, (349), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2022-11-16 12:12:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4183 transitions. [2022-11-16 12:12:28,355 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4183 transitions. Word has length 65 [2022-11-16 12:12:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:28,355 INFO L495 AbstractCegarLoop]: Abstraction has 3099 states and 4183 transitions. [2022-11-16 12:12:28,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4183 transitions. [2022-11-16 12:12:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:12:28,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:28,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:28,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:12:28,357 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2022-11-16 12:12:28,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:28,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955708984] [2022-11-16 12:12:28,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:28,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:28,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955708984] [2022-11-16 12:12:28,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955708984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:28,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:28,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:12:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297628523] [2022-11-16 12:12:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:28,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:12:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:12:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:12:28,480 INFO L87 Difference]: Start difference. First operand 3099 states and 4183 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:29,568 INFO L93 Difference]: Finished difference Result 6174 states and 8162 transitions. [2022-11-16 12:12:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:12:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-16 12:12:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:29,594 INFO L225 Difference]: With dead ends: 6174 [2022-11-16 12:12:29,595 INFO L226 Difference]: Without dead ends: 4742 [2022-11-16 12:12:29,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:12:29,601 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 820 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:29,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 484 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:12:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2022-11-16 12:12:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4470. [2022-11-16 12:12:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4470 states, 3528 states have (on average 1.312358276643991) internal successors, (4630), 3603 states have internal predecessors, (4630), 501 states have call successors, (501), 368 states have call predecessors, (501), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2022-11-16 12:12:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5924 transitions. [2022-11-16 12:12:30,301 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5924 transitions. Word has length 65 [2022-11-16 12:12:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:30,301 INFO L495 AbstractCegarLoop]: Abstraction has 4470 states and 5924 transitions. [2022-11-16 12:12:30,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-16 12:12:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5924 transitions. [2022-11-16 12:12:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 12:12:30,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:30,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:30,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:12:30,306 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2022-11-16 12:12:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:30,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32933552] [2022-11-16 12:12:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:30,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32933552] [2022-11-16 12:12:30,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32933552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:30,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:30,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:12:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135289666] [2022-11-16 12:12:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:30,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:12:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:12:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:12:30,398 INFO L87 Difference]: Start difference. First operand 4470 states and 5924 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:12:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:31,659 INFO L93 Difference]: Finished difference Result 9488 states and 12438 transitions. [2022-11-16 12:12:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:12:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-16 12:12:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:31,694 INFO L225 Difference]: With dead ends: 9488 [2022-11-16 12:12:31,694 INFO L226 Difference]: Without dead ends: 6664 [2022-11-16 12:12:31,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:12:31,705 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 392 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:31,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 727 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:12:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2022-11-16 12:12:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6148. [2022-11-16 12:12:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 4813 states have (on average 1.2944109702888011) internal successors, (6230), 4895 states have internal predecessors, (6230), 695 states have call successors, (695), 542 states have call predecessors, (695), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2022-11-16 12:12:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8039 transitions. [2022-11-16 12:12:32,504 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8039 transitions. Word has length 66 [2022-11-16 12:12:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:32,505 INFO L495 AbstractCegarLoop]: Abstraction has 6148 states and 8039 transitions. [2022-11-16 12:12:32,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-16 12:12:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8039 transitions. [2022-11-16 12:12:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 12:12:32,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:32,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:32,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:12:32,511 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:32,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2022-11-16 12:12:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:32,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890036205] [2022-11-16 12:12:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:32,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890036205] [2022-11-16 12:12:32,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890036205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:32,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:32,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:12:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138296833] [2022-11-16 12:12:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:12:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:12:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:12:32,626 INFO L87 Difference]: Start difference. First operand 6148 states and 8039 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:12:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:34,117 INFO L93 Difference]: Finished difference Result 7778 states and 10041 transitions. [2022-11-16 12:12:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:12:34,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-11-16 12:12:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:34,152 INFO L225 Difference]: With dead ends: 7778 [2022-11-16 12:12:34,152 INFO L226 Difference]: Without dead ends: 7775 [2022-11-16 12:12:34,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:12:34,157 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 960 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:34,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 493 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:12:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2022-11-16 12:12:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 7202. [2022-11-16 12:12:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7202 states, 5616 states have (on average 1.2820512820512822) internal successors, (7200), 5707 states have internal predecessors, (7200), 821 states have call successors, (821), 656 states have call predecessors, (821), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2022-11-16 12:12:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 9328 transitions. [2022-11-16 12:12:35,229 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 9328 transitions. Word has length 73 [2022-11-16 12:12:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:35,230 INFO L495 AbstractCegarLoop]: Abstraction has 7202 states and 9328 transitions. [2022-11-16 12:12:35,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:12:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 9328 transitions. [2022-11-16 12:12:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 12:12:35,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:35,234 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:35,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:12:35,234 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2022-11-16 12:12:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:35,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703191328] [2022-11-16 12:12:35,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:35,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703191328] [2022-11-16 12:12:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703191328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730179341] [2022-11-16 12:12:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:35,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:35,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:12:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:35,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:12:35,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:35,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:12:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:36,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730179341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:12:36,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:12:36,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-11-16 12:12:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128661229] [2022-11-16 12:12:36,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:12:36,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:12:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:12:36,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:12:36,125 INFO L87 Difference]: Start difference. First operand 7202 states and 9328 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-16 12:12:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:40,609 INFO L93 Difference]: Finished difference Result 14848 states and 18856 transitions. [2022-11-16 12:12:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 12:12:40,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-11-16 12:12:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:40,674 INFO L225 Difference]: With dead ends: 14848 [2022-11-16 12:12:40,675 INFO L226 Difference]: Without dead ends: 14845 [2022-11-16 12:12:40,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-11-16 12:12:40,683 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 1159 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:40,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1462 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 12:12:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14845 states. [2022-11-16 12:12:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14845 to 12460. [2022-11-16 12:12:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12460 states, 9708 states have (on average 1.2679233621755253) internal successors, (12309), 9851 states have internal predecessors, (12309), 1387 states have call successors, (1387), 1146 states have call predecessors, (1387), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2022-11-16 12:12:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 15942 transitions. [2022-11-16 12:12:42,407 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 15942 transitions. Word has length 74 [2022-11-16 12:12:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:42,408 INFO L495 AbstractCegarLoop]: Abstraction has 12460 states and 15942 transitions. [2022-11-16 12:12:42,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-16 12:12:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 15942 transitions. [2022-11-16 12:12:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:12:42,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:42,413 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:42,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:42,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:12:42,620 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2022-11-16 12:12:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:42,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773431156] [2022-11-16 12:12:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:12:42,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:42,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773431156] [2022-11-16 12:12:42,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773431156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:42,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:42,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:12:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78997370] [2022-11-16 12:12:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:42,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:12:42,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:42,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:12:42,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:12:42,701 INFO L87 Difference]: Start difference. First operand 12460 states and 15942 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:12:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:44,724 INFO L93 Difference]: Finished difference Result 19003 states and 24284 transitions. [2022-11-16 12:12:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:12:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-11-16 12:12:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:44,767 INFO L225 Difference]: With dead ends: 19003 [2022-11-16 12:12:44,767 INFO L226 Difference]: Without dead ends: 9065 [2022-11-16 12:12:44,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:12:44,798 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 449 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:44,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 709 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:12:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2022-11-16 12:12:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8513. [2022-11-16 12:12:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8513 states, 6655 states have (on average 1.2545454545454546) internal successors, (8349), 6754 states have internal predecessors, (8349), 954 states have call successors, (954), 770 states have call predecessors, (954), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2022-11-16 12:12:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8513 states to 8513 states and 10768 transitions. [2022-11-16 12:12:46,203 INFO L78 Accepts]: Start accepts. Automaton has 8513 states and 10768 transitions. Word has length 77 [2022-11-16 12:12:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:46,203 INFO L495 AbstractCegarLoop]: Abstraction has 8513 states and 10768 transitions. [2022-11-16 12:12:46,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-16 12:12:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 8513 states and 10768 transitions. [2022-11-16 12:12:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 12:12:46,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:46,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:46,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:12:46,210 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2022-11-16 12:12:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:46,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095978543] [2022-11-16 12:12:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:12:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:12:46,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095978543] [2022-11-16 12:12:46,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095978543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:46,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:46,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:12:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069570078] [2022-11-16 12:12:46,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:46,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:12:46,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:12:46,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:12:46,368 INFO L87 Difference]: Start difference. First operand 8513 states and 10768 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:12:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:49,437 INFO L93 Difference]: Finished difference Result 22387 states and 27985 transitions. [2022-11-16 12:12:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:12:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-11-16 12:12:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:49,503 INFO L225 Difference]: With dead ends: 22387 [2022-11-16 12:12:49,504 INFO L226 Difference]: Without dead ends: 15544 [2022-11-16 12:12:49,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:12:49,524 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 775 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:49,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 843 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:12:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15544 states. [2022-11-16 12:12:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15544 to 14685. [2022-11-16 12:12:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14685 states, 11331 states have (on average 1.2210749271908923) internal successors, (13836), 11536 states have internal predecessors, (13836), 1670 states have call successors, (1670), 1374 states have call predecessors, (1670), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2022-11-16 12:12:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 18374 transitions. [2022-11-16 12:12:51,364 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 18374 transitions. Word has length 84 [2022-11-16 12:12:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:51,365 INFO L495 AbstractCegarLoop]: Abstraction has 14685 states and 18374 transitions. [2022-11-16 12:12:51,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:12:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 18374 transitions. [2022-11-16 12:12:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-16 12:12:51,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:51,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:51,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:12:51,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash -559065813, now seen corresponding path program 1 times [2022-11-16 12:12:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:51,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447302885] [2022-11-16 12:12:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:12:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:12:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:12:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:12:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:12:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:12:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:12:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 12:12:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447302885] [2022-11-16 12:12:51,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447302885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880488316] [2022-11-16 12:12:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:51,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:51,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:51,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:12:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:51,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:12:51,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:12:51,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:12:51,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880488316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:51,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:12:51,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:12:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743860654] [2022-11-16 12:12:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:51,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:12:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:51,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:12:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:12:51,664 INFO L87 Difference]: Start difference. First operand 14685 states and 18374 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:12:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:53,784 INFO L93 Difference]: Finished difference Result 17754 states and 22695 transitions. [2022-11-16 12:12:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:12:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-11-16 12:12:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:53,862 INFO L225 Difference]: With dead ends: 17754 [2022-11-16 12:12:53,862 INFO L226 Difference]: Without dead ends: 15078 [2022-11-16 12:12:53,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:12:53,878 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 114 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:53,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 676 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:12:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15078 states. [2022-11-16 12:12:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15078 to 15078. [2022-11-16 12:12:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15078 states, 11650 states have (on average 1.2243776824034336) internal successors, (14264), 11859 states have internal predecessors, (14264), 1712 states have call successors, (1712), 1402 states have call predecessors, (1712), 1714 states have return successors, (2932), 1832 states have call predecessors, (2932), 1709 states have call successors, (2932) [2022-11-16 12:12:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15078 states to 15078 states and 18908 transitions. [2022-11-16 12:12:56,264 INFO L78 Accepts]: Start accepts. Automaton has 15078 states and 18908 transitions. Word has length 93 [2022-11-16 12:12:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:56,264 INFO L495 AbstractCegarLoop]: Abstraction has 15078 states and 18908 transitions. [2022-11-16 12:12:56,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:12:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 15078 states and 18908 transitions. [2022-11-16 12:12:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-16 12:12:56,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:56,275 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:56,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:56,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:12:56,482 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2022-11-16 12:12:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:56,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045479488] [2022-11-16 12:12:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:12:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:12:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:12:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:12:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:12:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 12:12:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045479488] [2022-11-16 12:12:56,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045479488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:56,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:56,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:12:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935064497] [2022-11-16 12:12:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:56,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:12:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:12:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:12:56,669 INFO L87 Difference]: Start difference. First operand 15078 states and 18908 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:12:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:59,647 INFO L93 Difference]: Finished difference Result 25952 states and 32227 transitions. [2022-11-16 12:12:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:12:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-11-16 12:12:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:59,693 INFO L225 Difference]: With dead ends: 25952 [2022-11-16 12:12:59,694 INFO L226 Difference]: Without dead ends: 13553 [2022-11-16 12:12:59,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-16 12:12:59,722 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 1147 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:59,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1010 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:12:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2022-11-16 12:13:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 12653. [2022-11-16 12:13:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12653 states, 9816 states have (on average 1.2199470252648736) internal successors, (11975), 9992 states have internal predecessors, (11975), 1413 states have call successors, (1413), 1151 states have call predecessors, (1413), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2022-11-16 12:13:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 15652 transitions. [2022-11-16 12:13:01,155 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 15652 transitions. Word has length 93 [2022-11-16 12:13:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:01,155 INFO L495 AbstractCegarLoop]: Abstraction has 12653 states and 15652 transitions. [2022-11-16 12:13:01,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 12:13:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 15652 transitions. [2022-11-16 12:13:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-16 12:13:01,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:01,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:01,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:13:01,168 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1056840823, now seen corresponding path program 1 times [2022-11-16 12:13:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:01,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950822761] [2022-11-16 12:13:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:13:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:13:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:13:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 12:13:01,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:01,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950822761] [2022-11-16 12:13:01,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950822761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:01,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359659011] [2022-11-16 12:13:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:01,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:01,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:01,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:13:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:01,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:13:01,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:13:01,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:01,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359659011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:01,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:01,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-16 12:13:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417393815] [2022-11-16 12:13:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:01,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:13:01,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:01,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:13:01,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:01,610 INFO L87 Difference]: Start difference. First operand 12653 states and 15652 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:13:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:02,835 INFO L93 Difference]: Finished difference Result 15507 states and 19695 transitions. [2022-11-16 12:13:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:13:02,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-11-16 12:13:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:02,876 INFO L225 Difference]: With dead ends: 15507 [2022-11-16 12:13:02,877 INFO L226 Difference]: Without dead ends: 13862 [2022-11-16 12:13:02,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:02,888 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 209 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:02,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13862 states. [2022-11-16 12:13:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13862 to 13818. [2022-11-16 12:13:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13818 states, 10756 states have (on average 1.2332651543324655) internal successors, (13265), 10949 states have internal predecessors, (13265), 1541 states have call successors, (1541), 1236 states have call predecessors, (1541), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2022-11-16 12:13:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13818 states to 13818 states and 17250 transitions. [2022-11-16 12:13:04,466 INFO L78 Accepts]: Start accepts. Automaton has 13818 states and 17250 transitions. Word has length 119 [2022-11-16 12:13:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:04,467 INFO L495 AbstractCegarLoop]: Abstraction has 13818 states and 17250 transitions. [2022-11-16 12:13:04,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:13:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 13818 states and 17250 transitions. [2022-11-16 12:13:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 12:13:04,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:04,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:04,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:04,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:04,691 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash 131680678, now seen corresponding path program 1 times [2022-11-16 12:13:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:04,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025673685] [2022-11-16 12:13:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:13:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:13:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:13:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-16 12:13:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-16 12:13:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:04,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025673685] [2022-11-16 12:13:04,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025673685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853804267] [2022-11-16 12:13:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:04,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:04,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:13:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:05,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:13:05,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 12:13:05,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:05,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853804267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:05,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:05,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:13:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628590400] [2022-11-16 12:13:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:05,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:13:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:13:05,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:05,064 INFO L87 Difference]: Start difference. First operand 13818 states and 17250 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-16 12:13:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:06,424 INFO L93 Difference]: Finished difference Result 17504 states and 22428 transitions. [2022-11-16 12:13:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:13:06,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-11-16 12:13:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:06,469 INFO L225 Difference]: With dead ends: 17504 [2022-11-16 12:13:06,469 INFO L226 Difference]: Without dead ends: 14312 [2022-11-16 12:13:06,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:06,480 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 260 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:06,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14312 states. [2022-11-16 12:13:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14312 to 14202. [2022-11-16 12:13:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14202 states, 11115 states have (on average 1.2191632928475034) internal successors, (13551), 11303 states have internal predecessors, (13551), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-11-16 12:13:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14202 states to 14202 states and 17514 transitions. [2022-11-16 12:13:08,258 INFO L78 Accepts]: Start accepts. Automaton has 14202 states and 17514 transitions. Word has length 135 [2022-11-16 12:13:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:08,258 INFO L495 AbstractCegarLoop]: Abstraction has 14202 states and 17514 transitions. [2022-11-16 12:13:08,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-16 12:13:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14202 states and 17514 transitions. [2022-11-16 12:13:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 12:13:08,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:08,275 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:08,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:08,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:08,481 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1548570021, now seen corresponding path program 1 times [2022-11-16 12:13:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845573492] [2022-11-16 12:13:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:13:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:13:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:13:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-16 12:13:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-16 12:13:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845573492] [2022-11-16 12:13:08,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845573492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349410495] [2022-11-16 12:13:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:08,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:08,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:08,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:08,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:13:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:08,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:13:08,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:13:08,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:08,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349410495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:08,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:08,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:13:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700792856] [2022-11-16 12:13:08,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:08,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:13:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:13:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:08,793 INFO L87 Difference]: Start difference. First operand 14202 states and 17514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 12:13:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:10,238 INFO L93 Difference]: Finished difference Result 17861 states and 22355 transitions. [2022-11-16 12:13:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:13:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-11-16 12:13:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:10,274 INFO L225 Difference]: With dead ends: 17861 [2022-11-16 12:13:10,275 INFO L226 Difference]: Without dead ends: 14287 [2022-11-16 12:13:10,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:10,286 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 248 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:10,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14287 states. [2022-11-16 12:13:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14287 to 14172. [2022-11-16 12:13:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14172 states, 11085 states have (on average 1.211637347767253) internal successors, (13431), 11273 states have internal predecessors, (13431), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-11-16 12:13:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 17394 transitions. [2022-11-16 12:13:12,212 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 17394 transitions. Word has length 135 [2022-11-16 12:13:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:12,212 INFO L495 AbstractCegarLoop]: Abstraction has 14172 states and 17394 transitions. [2022-11-16 12:13:12,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 12:13:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 17394 transitions. [2022-11-16 12:13:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 12:13:12,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:12,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:12,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:12,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:12,433 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash 367339351, now seen corresponding path program 1 times [2022-11-16 12:13:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:12,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737116848] [2022-11-16 12:13:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:13:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:13:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:13:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 12:13:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-16 12:13:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737116848] [2022-11-16 12:13:12,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737116848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295291847] [2022-11-16 12:13:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:12,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:12,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:12,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:13:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:12,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:13:12,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 12:13:12,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:12,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295291847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:12,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:12,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-16 12:13:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728866333] [2022-11-16 12:13:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:12,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:13:12,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:13:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:12,850 INFO L87 Difference]: Start difference. First operand 14172 states and 17394 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:13:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:14,252 INFO L93 Difference]: Finished difference Result 15677 states and 19438 transitions. [2022-11-16 12:13:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:13:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2022-11-16 12:13:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:14,287 INFO L225 Difference]: With dead ends: 15677 [2022-11-16 12:13:14,287 INFO L226 Difference]: Without dead ends: 13893 [2022-11-16 12:13:14,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:13:14,297 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 88 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:14,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 650 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2022-11-16 12:13:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 13829. [2022-11-16 12:13:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 10810 states have (on average 1.2055504162812212) internal successors, (13032), 10994 states have internal predecessors, (13032), 1501 states have call successors, (1501), 1237 states have call predecessors, (1501), 1516 states have return successors, (2362), 1610 states have call predecessors, (2362), 1498 states have call successors, (2362) [2022-11-16 12:13:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 16895 transitions. [2022-11-16 12:13:15,792 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 16895 transitions. Word has length 136 [2022-11-16 12:13:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:15,793 INFO L495 AbstractCegarLoop]: Abstraction has 13829 states and 16895 transitions. [2022-11-16 12:13:15,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:13:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 16895 transitions. [2022-11-16 12:13:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-16 12:13:15,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:15,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:15,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:16,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:16,009 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2008230337, now seen corresponding path program 1 times [2022-11-16 12:13:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:16,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271886174] [2022-11-16 12:13:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:13:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:13:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:13:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:13:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 12:13:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:16,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271886174] [2022-11-16 12:13:16,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271886174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:16,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685468487] [2022-11-16 12:13:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:16,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:16,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:16,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:13:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:16,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:13:16,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 12:13:16,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:16,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685468487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:16,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:16,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-16 12:13:16,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491770508] [2022-11-16 12:13:16,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:16,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:13:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:16,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:13:16,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:13:16,429 INFO L87 Difference]: Start difference. First operand 13829 states and 16895 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:13:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:18,500 INFO L93 Difference]: Finished difference Result 15723 states and 19305 transitions. [2022-11-16 12:13:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:13:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-16 12:13:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:18,526 INFO L225 Difference]: With dead ends: 15723 [2022-11-16 12:13:18,526 INFO L226 Difference]: Without dead ends: 12689 [2022-11-16 12:13:18,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:13:18,533 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 340 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:18,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 426 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:13:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12689 states. [2022-11-16 12:13:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12689 to 12501. [2022-11-16 12:13:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12501 states, 9730 states have (on average 1.18879753340185) internal successors, (11567), 9890 states have internal predecessors, (11567), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-11-16 12:13:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12501 states to 12501 states and 15067 transitions. [2022-11-16 12:13:19,848 INFO L78 Accepts]: Start accepts. Automaton has 12501 states and 15067 transitions. Word has length 137 [2022-11-16 12:13:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:19,848 INFO L495 AbstractCegarLoop]: Abstraction has 12501 states and 15067 transitions. [2022-11-16 12:13:19,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:13:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 12501 states and 15067 transitions. [2022-11-16 12:13:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-16 12:13:19,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:19,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:19,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 12:13:20,067 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash 979594561, now seen corresponding path program 1 times [2022-11-16 12:13:20,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:20,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234618725] [2022-11-16 12:13:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:13:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:13:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:13:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:13:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 12:13:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:20,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234618725] [2022-11-16 12:13:20,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234618725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:20,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963199204] [2022-11-16 12:13:20,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:20,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:20,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:20,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:13:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:20,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:13:20,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-16 12:13:20,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:20,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963199204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:20,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:20,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-16 12:13:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046958720] [2022-11-16 12:13:20,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:20,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:13:20,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:13:20,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:13:20,414 INFO L87 Difference]: Start difference. First operand 12501 states and 15067 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:13:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:21,934 INFO L93 Difference]: Finished difference Result 14431 states and 17466 transitions. [2022-11-16 12:13:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:13:21,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 [2022-11-16 12:13:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:21,960 INFO L225 Difference]: With dead ends: 14431 [2022-11-16 12:13:21,960 INFO L226 Difference]: Without dead ends: 12557 [2022-11-16 12:13:21,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:13:21,966 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:21,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1103 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2022-11-16 12:13:23,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12525. [2022-11-16 12:13:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12525 states, 9754 states have (on average 1.1847447201148247) internal successors, (11556), 9914 states have internal predecessors, (11556), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-11-16 12:13:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12525 states to 12525 states and 15056 transitions. [2022-11-16 12:13:23,264 INFO L78 Accepts]: Start accepts. Automaton has 12525 states and 15056 transitions. Word has length 137 [2022-11-16 12:13:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:23,264 INFO L495 AbstractCegarLoop]: Abstraction has 12525 states and 15056 transitions. [2022-11-16 12:13:23,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:13:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 12525 states and 15056 transitions. [2022-11-16 12:13:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-16 12:13:23,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:23,273 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:23,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:23,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 12:13:23,474 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:23,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2022-11-16 12:13:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:23,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446706624] [2022-11-16 12:13:23,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:23,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:13:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:13:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:13:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:13:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-16 12:13:23,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:23,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446706624] [2022-11-16 12:13:23,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446706624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:23,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:13:23,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:13:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732086734] [2022-11-16 12:13:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:23,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:13:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:23,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:13:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:13:23,701 INFO L87 Difference]: Start difference. First operand 12525 states and 15056 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 12:13:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:26,190 INFO L93 Difference]: Finished difference Result 13983 states and 16730 transitions. [2022-11-16 12:13:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:13:26,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-11-16 12:13:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:26,218 INFO L225 Difference]: With dead ends: 13983 [2022-11-16 12:13:26,218 INFO L226 Difference]: Without dead ends: 13980 [2022-11-16 12:13:26,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:13:26,223 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 738 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:26,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 716 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:13:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2022-11-16 12:13:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 13496. [2022-11-16 12:13:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13496 states, 10552 states have (on average 1.182524639878696) internal successors, (12478), 10722 states have internal predecessors, (12478), 1454 states have call successors, (1454), 1207 states have call predecessors, (1454), 1488 states have return successors, (2252), 1577 states have call predecessors, (2252), 1451 states have call successors, (2252) [2022-11-16 12:13:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 16184 transitions. [2022-11-16 12:13:27,690 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 16184 transitions. Word has length 137 [2022-11-16 12:13:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:27,690 INFO L495 AbstractCegarLoop]: Abstraction has 13496 states and 16184 transitions. [2022-11-16 12:13:27,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 12:13:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 16184 transitions. [2022-11-16 12:13:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 12:13:27,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:27,702 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:27,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 12:13:27,702 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2022-11-16 12:13:27,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:27,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139130527] [2022-11-16 12:13:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:13:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:13:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:13:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:13:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:13:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:13:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:13:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:13:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:13:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:13:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:13:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-16 12:13:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:13:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-16 12:13:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:27,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139130527] [2022-11-16 12:13:27,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139130527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:27,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018814982] [2022-11-16 12:13:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:27,895 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:27,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:13:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:28,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:13:28,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:13:28,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:28,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018814982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:28,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:28,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-11-16 12:13:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56030094] [2022-11-16 12:13:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:28,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:13:28,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:28,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:13:28,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:13:28,086 INFO L87 Difference]: Start difference. First operand 13496 states and 16184 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:13:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:29,202 INFO L93 Difference]: Finished difference Result 18644 states and 22404 transitions. [2022-11-16 12:13:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:13:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-11-16 12:13:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:29,220 INFO L225 Difference]: With dead ends: 18644 [2022-11-16 12:13:29,220 INFO L226 Difference]: Without dead ends: 8062 [2022-11-16 12:13:29,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:13:29,233 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 34 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:29,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-11-16 12:13:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 7620. [2022-11-16 12:13:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 6117 states have (on average 1.1678927578878535) internal successors, (7144), 6185 states have internal predecessors, (7144), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-11-16 12:13:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 8992 transitions. [2022-11-16 12:13:30,121 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 8992 transitions. Word has length 145 [2022-11-16 12:13:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:30,122 INFO L495 AbstractCegarLoop]: Abstraction has 7620 states and 8992 transitions. [2022-11-16 12:13:30,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:13:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 8992 transitions. [2022-11-16 12:13:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-16 12:13:30,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:30,128 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:30,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:30,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 12:13:30,329 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2022-11-16 12:13:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:30,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431521795] [2022-11-16 12:13:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:30,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:13:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:13:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:13:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:13:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:13:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:13:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:13:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:13:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:13:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:13:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-16 12:13:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:30,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431521795] [2022-11-16 12:13:30,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431521795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:30,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:13:30,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:13:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80090591] [2022-11-16 12:13:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:30,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:13:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:13:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:13:30,439 INFO L87 Difference]: Start difference. First operand 7620 states and 8992 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:13:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:31,885 INFO L93 Difference]: Finished difference Result 10269 states and 12313 transitions. [2022-11-16 12:13:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:13:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-11-16 12:13:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:31,904 INFO L225 Difference]: With dead ends: 10269 [2022-11-16 12:13:31,904 INFO L226 Difference]: Without dead ends: 8441 [2022-11-16 12:13:31,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:13:31,910 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 251 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:31,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 695 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:13:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2022-11-16 12:13:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 7623. [2022-11-16 12:13:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7623 states, 6120 states have (on average 1.16781045751634) internal successors, (7147), 6188 states have internal predecessors, (7147), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-11-16 12:13:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 8995 transitions. [2022-11-16 12:13:32,840 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 8995 transitions. Word has length 141 [2022-11-16 12:13:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:32,841 INFO L495 AbstractCegarLoop]: Abstraction has 7623 states and 8995 transitions. [2022-11-16 12:13:32,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:13:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 8995 transitions. [2022-11-16 12:13:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-16 12:13:32,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:32,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:32,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 12:13:32,848 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2022-11-16 12:13:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:32,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375832009] [2022-11-16 12:13:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:13:32,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:13:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:13:32,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:13:32,942 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:13:32,943 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-16 12:13:32,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-16 12:13:32,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 12:13:32,950 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:32,955 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:13:33,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:13:33 BoogieIcfgContainer [2022-11-16 12:13:33,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:13:33,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:13:33,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:13:33,119 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:13:33,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:07" (3/4) ... [2022-11-16 12:13:33,121 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:13:33,250 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:13:33,250 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:13:33,251 INFO L158 Benchmark]: Toolchain (without parser) took 87190.48ms. Allocated memory was 107.0MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 74.2MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 666.5MB. Max. memory is 16.1GB. [2022-11-16 12:13:33,251 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:13:33,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.87ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 78.1MB in the end (delta: -4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:13:33,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.13ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 75.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:13:33,252 INFO L158 Benchmark]: Boogie Preprocessor took 50.40ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:13:33,253 INFO L158 Benchmark]: RCFGBuilder took 987.45ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 73.1MB in the beginning and 118.0MB in the end (delta: -44.9MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2022-11-16 12:13:33,253 INFO L158 Benchmark]: TraceAbstraction took 85360.04ms. Allocated memory was 146.8MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 117.3MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 653.4MB. Max. memory is 16.1GB. [2022-11-16 12:13:33,254 INFO L158 Benchmark]: Witness Printer took 132.33ms. Allocated memory is still 4.3GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-16 12:13:33,256 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.33ms. Allocated memory is still 107.0MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.87ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 78.1MB in the end (delta: -4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.13ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 75.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.40ms. Allocated memory is still 107.0MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 987.45ms. Allocated memory was 107.0MB in the beginning and 146.8MB in the end (delta: 39.8MB). Free memory was 73.1MB in the beginning and 118.0MB in the end (delta: -44.9MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * TraceAbstraction took 85360.04ms. Allocated memory was 146.8MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 117.3MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 653.4MB. Max. memory is 16.1GB. * Witness Printer took 132.33ms. Allocated memory is still 4.3GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L502] int m_st ; [L34] int q_free ; [L507] int T1_E = 2; [L35] int q_read_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L66] int c_dr_st ; [L68] int c_dr_i ; [L33] int q_buf_0 ; [L515] int local ; [L501] int t1_pc = 0; [L59] int p_num_write ; [L505] int t1_i ; [L506] int M_E = 2; [L508] int E_M = 2; [L504] int m_i ; [L172] static int a_t ; [L503] int t1_st ; [L36] int q_write_ev ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L513] int token ; [L61] int p_dw_st ; [L65] int c_last_read ; [L67] int c_dr_pc ; [L509] int E_1 = 2; [L500] int m_pc = 0; [L60] int p_last_write ; [L64] int c_num_read ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 216 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 85.1s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 48.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15374 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14998 mSDsluCounter, 22766 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15933 mSDsCounter, 3389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15787 IncrementalHoareTripleChecker+Invalid, 19176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3389 mSolverCounterUnsat, 6833 mSDtfsCounter, 15787 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1756 SyntacticMatches, 5 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15078occurred in iteration=18, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 9769 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 3780 NumberOfCodeBlocks, 3780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3674 ConstructedInterpolants, 0 QuantifiedInterpolants, 7257 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3759 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 1262/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:13:33,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f74770c-7519-4432-9c55-f37ee5ca661f/bin/uautomizer-tPACEb0tL8/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