./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- Real Ultimate output --- [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-b5237d8 [2022-11-21 16:14:21,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:14:21,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:14:21,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:14:21,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:14:21,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:14:21,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:14:21,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:14:21,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:14:21,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:14:21,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:14:21,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:14:21,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:14:21,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:14:21,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:14:21,647 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:14:21,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:14:21,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:14:21,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:14:21,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:14:21,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:14:21,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:14:21,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:14:21,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:14:21,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:14:21,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:14:21,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:14:21,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:14:21,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:14:21,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:14:21,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:14:21,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:14:21,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:14:21,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:14:21,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:14:21,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:14:21,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:14:21,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:14:21,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:14:21,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:14:21,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:14:21,680 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:14:21,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:14:21,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:14:21,723 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:14:21,723 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:14:21,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:14:21,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:14:21,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:14:21,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:14:21,727 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:14:21,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:14:21,727 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:14:21,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:14:21,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:14:21,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:14:21,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:14:21,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:14:21,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:14:21,730 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:14:21,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:14:21,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:14:21,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:14:21,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:14:21,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:14:21,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:14:21,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:14:21,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:14:21,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:14:21,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:14:21,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:14:21,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:14:21,735 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:14:21,735 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:14:21,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:14:21,736 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_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/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_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2022-11-21 16:14:22,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:14:22,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:14:22,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:14:22,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:14:22,116 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:14:22,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-11-21 16:14:25,589 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:14:25,944 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:14:25,945 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-11-21 16:14:25,965 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/data/633fc95a8/071c15cb9cbe4b77b93fa582a7449e90/FLAGe7d359d53 [2022-11-21 16:14:25,981 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/data/633fc95a8/071c15cb9cbe4b77b93fa582a7449e90 [2022-11-21 16:14:25,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:14:25,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:14:25,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:14:25,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:14:25,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:14:26,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:14:25" (1/1) ... [2022-11-21 16:14:26,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ee166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26, skipping insertion in model container [2022-11-21 16:14:26,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:14:25" (1/1) ... [2022-11-21 16:14:26,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:14:26,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:14:26,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2022-11-21 16:14:26,311 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2022-11-21 16:14:26,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:14:26,353 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:14:26,366 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2022-11-21 16:14:26,393 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2022-11-21 16:14:26,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:14:26,432 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:14:26,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26 WrapperNode [2022-11-21 16:14:26,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:14:26,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:14:26,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:14:26,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:14:26,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,490 INFO L138 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 445 [2022-11-21 16:14:26,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:14:26,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:14:26,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:14:26,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:14:26,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:14:26,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:14:26,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:14:26,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:14:26,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (1/1) ... [2022-11-21 16:14:26,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:14:26,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:14:26,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:14:26,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:14:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:14:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-21 16:14:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-21 16:14:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-21 16:14:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-21 16:14:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-21 16:14:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-21 16:14:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-21 16:14:26,643 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-21 16:14:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-21 16:14:26,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-21 16:14:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-21 16:14:26,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-21 16:14:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-21 16:14:26,644 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-21 16:14:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-21 16:14:26,644 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-21 16:14:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-21 16:14:26,644 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-21 16:14:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-21 16:14:26,644 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-21 16:14:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-21 16:14:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-21 16:14:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:14:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-21 16:14:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-21 16:14:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-21 16:14:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-21 16:14:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:14:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:14:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-21 16:14:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-21 16:14:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-21 16:14:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-21 16:14:26,848 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:14:26,851 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:14:27,631 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-21 16:14:27,632 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-21 16:14:27,716 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:14:27,736 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:14:27,740 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-21 16:14:27,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:14:27 BoogieIcfgContainer [2022-11-21 16:14:27,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:14:27,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:14:27,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:14:27,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:14:27,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:14:25" (1/3) ... [2022-11-21 16:14:27,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72326bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:14:27, skipping insertion in model container [2022-11-21 16:14:27,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:14:26" (2/3) ... [2022-11-21 16:14:27,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72326bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:14:27, skipping insertion in model container [2022-11-21 16:14:27,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:14:27" (3/3) ... [2022-11-21 16:14:27,766 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-11-21 16:14:27,793 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:14:27,793 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 16:14:27,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:14:27,903 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;@6dfbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:14:27,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-21 16:14:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-21 16:14:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:14:27,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:27,931 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-21 16:14:27,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash 560703049, now seen corresponding path program 1 times [2022-11-21 16:14:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:27,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193990676] [2022-11-21 16:14:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:27,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:14:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:14:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:14:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:28,689 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-21 16:14:28,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:28,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193990676] [2022-11-21 16:14:28,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193990676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:28,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:28,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:14:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703147630] [2022-11-21 16:14:28,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:28,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:14:28,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:14:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:14:28,774 INFO L87 Difference]: Start difference. First operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:14:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:30,197 INFO L93 Difference]: Finished difference Result 584 states and 884 transitions. [2022-11-21 16:14:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:14:30,200 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-21 16:14:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:30,216 INFO L225 Difference]: With dead ends: 584 [2022-11-21 16:14:30,217 INFO L226 Difference]: Without dead ends: 359 [2022-11-21 16:14:30,222 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-21 16:14:30,226 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 580 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:30,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 748 Invalid, 767 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 16:14:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-21 16:14:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 316. [2022-11-21 16:14:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-11-21 16:14:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 452 transitions. [2022-11-21 16:14:30,331 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 452 transitions. Word has length 58 [2022-11-21 16:14:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:30,332 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 452 transitions. [2022-11-21 16:14:30,332 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-21 16:14:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2022-11-21 16:14:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:14:30,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:30,336 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-21 16:14:30,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:14:30,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1940005051, now seen corresponding path program 1 times [2022-11-21 16:14:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:30,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873523854] [2022-11-21 16:14:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:14:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:14:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:14:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:30,637 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-21 16:14:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:30,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873523854] [2022-11-21 16:14:30,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873523854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:30,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:30,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:14:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596307333] [2022-11-21 16:14:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:30,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:14:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:30,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:14:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:14:30,643 INFO L87 Difference]: Start difference. First operand 316 states and 452 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:14:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:31,839 INFO L93 Difference]: Finished difference Result 667 states and 960 transitions. [2022-11-21 16:14:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:14:31,841 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-21 16:14:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:31,852 INFO L225 Difference]: With dead ends: 667 [2022-11-21 16:14:31,852 INFO L226 Difference]: Without dead ends: 472 [2022-11-21 16:14:31,861 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-21 16:14:31,862 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 559 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:31,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1087 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:14:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-21 16:14:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 406. [2022-11-21 16:14:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-11-21 16:14:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 579 transitions. [2022-11-21 16:14:31,974 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 579 transitions. Word has length 58 [2022-11-21 16:14:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:31,976 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 579 transitions. [2022-11-21 16:14:31,976 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-21 16:14:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 579 transitions. [2022-11-21 16:14:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:14:31,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:31,992 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-21 16:14:31,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:14:31,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1046518713, now seen corresponding path program 1 times [2022-11-21 16:14:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:31,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976032884] [2022-11-21 16:14:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:32,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:14:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:14:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:14:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:32,178 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-21 16:14:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:32,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976032884] [2022-11-21 16:14:32,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976032884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:32,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:32,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:14:32,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888954181] [2022-11-21 16:14:32,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:32,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:14:32,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:14:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:14:32,182 INFO L87 Difference]: Start difference. First operand 406 states and 579 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:14:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:32,879 INFO L93 Difference]: Finished difference Result 753 states and 1087 transitions. [2022-11-21 16:14:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:14:32,880 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-21 16:14:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:32,886 INFO L225 Difference]: With dead ends: 753 [2022-11-21 16:14:32,886 INFO L226 Difference]: Without dead ends: 468 [2022-11-21 16:14:32,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:14:32,900 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 601 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:32,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 583 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:14:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-21 16:14:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 406. [2022-11-21 16:14:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-11-21 16:14:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 576 transitions. [2022-11-21 16:14:32,985 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 576 transitions. Word has length 58 [2022-11-21 16:14:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:32,986 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 576 transitions. [2022-11-21 16:14:32,986 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-21 16:14:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 576 transitions. [2022-11-21 16:14:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:14:32,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:32,989 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-21 16:14:32,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:14:32,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:32,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1199060741, now seen corresponding path program 1 times [2022-11-21 16:14:32,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:32,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812253634] [2022-11-21 16:14:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:33,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:14:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:14:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:14:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:33,164 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-21 16:14:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:33,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812253634] [2022-11-21 16:14:33,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812253634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:33,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:33,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:14:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362828638] [2022-11-21 16:14:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:33,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:14:33,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:33,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:14:33,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:14:33,169 INFO L87 Difference]: Start difference. First operand 406 states and 576 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-21 16:14:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:34,196 INFO L93 Difference]: Finished difference Result 789 states and 1144 transitions. [2022-11-21 16:14:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:14:34,197 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-21 16:14:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:34,204 INFO L225 Difference]: With dead ends: 789 [2022-11-21 16:14:34,205 INFO L226 Difference]: Without dead ends: 505 [2022-11-21 16:14:34,209 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-21 16:14:34,218 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 290 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:34,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 990 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:14:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-21 16:14:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 415. [2022-11-21 16:14:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-11-21 16:14:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 585 transitions. [2022-11-21 16:14:34,291 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 585 transitions. Word has length 58 [2022-11-21 16:14:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:34,294 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 585 transitions. [2022-11-21 16:14:34,294 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-21 16:14:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 585 transitions. [2022-11-21 16:14:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:14:34,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:34,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:34,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:14:34,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:34,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1044922557, now seen corresponding path program 1 times [2022-11-21 16:14:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:34,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474567045] [2022-11-21 16:14:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:34,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:34,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:14:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:34,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:14:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:14:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:34,512 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-21 16:14:34,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:34,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474567045] [2022-11-21 16:14:34,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474567045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:34,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:34,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:14:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078743479] [2022-11-21 16:14:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:34,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:14:34,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:34,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:14:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:14:34,518 INFO L87 Difference]: Start difference. First operand 415 states and 585 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-21 16:14:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:36,377 INFO L93 Difference]: Finished difference Result 1587 states and 2310 transitions. [2022-11-21 16:14:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 16:14:36,378 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-21 16:14:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:36,388 INFO L225 Difference]: With dead ends: 1587 [2022-11-21 16:14:36,388 INFO L226 Difference]: Without dead ends: 1294 [2022-11-21 16:14:36,390 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-21 16:14:36,391 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 1113 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:36,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 904 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 16:14:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-11-21 16:14:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1123. [2022-11-21 16:14:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2022-11-21 16:14:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1569 transitions. [2022-11-21 16:14:36,572 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1569 transitions. Word has length 58 [2022-11-21 16:14:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:36,573 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1569 transitions. [2022-11-21 16:14:36,573 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-21 16:14:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1569 transitions. [2022-11-21 16:14:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 16:14:36,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:36,575 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-21 16:14:36,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:14:36,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash 863362558, now seen corresponding path program 1 times [2022-11-21 16:14:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:36,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890981980] [2022-11-21 16:14:36,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:14:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:14:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:14:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:36,781 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-21 16:14:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:36,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890981980] [2022-11-21 16:14:36,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890981980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:36,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:36,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:14:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333277] [2022-11-21 16:14:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:36,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:14:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:36,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:14:36,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:14:36,785 INFO L87 Difference]: Start difference. First operand 1123 states and 1569 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-21 16:14:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:37,889 INFO L93 Difference]: Finished difference Result 1378 states and 1939 transitions. [2022-11-21 16:14:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:14:37,890 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-21 16:14:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:37,899 INFO L225 Difference]: With dead ends: 1378 [2022-11-21 16:14:37,899 INFO L226 Difference]: Without dead ends: 1274 [2022-11-21 16:14:37,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:14:37,901 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 632 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:37,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 944 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:14:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-11-21 16:14:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1235. [2022-11-21 16:14:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2022-11-21 16:14:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1727 transitions. [2022-11-21 16:14:38,068 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1727 transitions. Word has length 65 [2022-11-21 16:14:38,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:38,069 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1727 transitions. [2022-11-21 16:14:38,069 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-21 16:14:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1727 transitions. [2022-11-21 16:14:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 16:14:38,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:38,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:38,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:14:38,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1752716098, now seen corresponding path program 1 times [2022-11-21 16:14:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:38,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843326176] [2022-11-21 16:14:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:14:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:14:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:14:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:38,236 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-21 16:14:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:38,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843326176] [2022-11-21 16:14:38,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843326176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:38,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:38,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:14:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330742222] [2022-11-21 16:14:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:38,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:14:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:14:38,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:14:38,240 INFO L87 Difference]: Start difference. First operand 1235 states and 1727 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-21 16:14:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:39,643 INFO L93 Difference]: Finished difference Result 1632 states and 2293 transitions. [2022-11-21 16:14:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:14:39,644 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-21 16:14:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:39,652 INFO L225 Difference]: With dead ends: 1632 [2022-11-21 16:14:39,652 INFO L226 Difference]: Without dead ends: 1423 [2022-11-21 16:14:39,656 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-21 16:14:39,657 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 623 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:39,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1102 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 16:14:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-11-21 16:14:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1347. [2022-11-21 16:14:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2022-11-21 16:14:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1887 transitions. [2022-11-21 16:14:39,833 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1887 transitions. Word has length 65 [2022-11-21 16:14:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:39,834 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 1887 transitions. [2022-11-21 16:14:39,834 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-21 16:14:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1887 transitions. [2022-11-21 16:14:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 16:14:39,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:39,837 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-21 16:14:39,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:14:39,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash 513665088, now seen corresponding path program 1 times [2022-11-21 16:14:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:39,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73787781] [2022-11-21 16:14:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:39,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:40,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 16:14:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:14:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-21 16:14:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:40,081 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-21 16:14:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73787781] [2022-11-21 16:14:40,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73787781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:40,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:40,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:14:40,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177507854] [2022-11-21 16:14:40,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:14:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:14:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:14:40,085 INFO L87 Difference]: Start difference. First operand 1347 states and 1887 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-21 16:14:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:42,655 INFO L93 Difference]: Finished difference Result 2893 states and 4085 transitions. [2022-11-21 16:14:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 16:14:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-11-21 16:14:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:42,670 INFO L225 Difference]: With dead ends: 2893 [2022-11-21 16:14:42,670 INFO L226 Difference]: Without dead ends: 2560 [2022-11-21 16:14:42,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-21 16:14:42,676 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 1990 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:42,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 1663 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-21 16:14:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2022-11-21 16:14:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2400. [2022-11-21 16:14:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) [2022-11-21 16:14:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3274 transitions. [2022-11-21 16:14:42,987 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3274 transitions. Word has length 65 [2022-11-21 16:14:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:42,989 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 3274 transitions. [2022-11-21 16:14:42,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-21 16:14:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3274 transitions. [2022-11-21 16:14:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-21 16:14:42,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:42,992 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-21 16:14:42,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:14:42,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2024207263, now seen corresponding path program 1 times [2022-11-21 16:14:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:42,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078220959] [2022-11-21 16:14:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 16:14:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:14:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:43,187 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-21 16:14:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078220959] [2022-11-21 16:14:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078220959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:43,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:43,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:14:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243044445] [2022-11-21 16:14:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:43,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:14:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:43,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:14:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:14:43,191 INFO L87 Difference]: Start difference. First operand 2400 states and 3274 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:14:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:44,424 INFO L93 Difference]: Finished difference Result 3928 states and 5353 transitions. [2022-11-21 16:14:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:14:44,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-21 16:14:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:44,439 INFO L225 Difference]: With dead ends: 3928 [2022-11-21 16:14:44,440 INFO L226 Difference]: Without dead ends: 2548 [2022-11-21 16:14:44,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:14:44,447 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 234 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:44,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1312 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:14:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2022-11-21 16:14:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2440. [2022-11-21 16:14:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) [2022-11-21 16:14:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3308 transitions. [2022-11-21 16:14:44,798 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3308 transitions. Word has length 66 [2022-11-21 16:14:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:44,798 INFO L495 AbstractCegarLoop]: Abstraction has 2440 states and 3308 transitions. [2022-11-21 16:14:44,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:14:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3308 transitions. [2022-11-21 16:14:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-21 16:14:44,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:44,801 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-21 16:14:44,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:14:44,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash 994847965, now seen corresponding path program 1 times [2022-11-21 16:14:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:44,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071257379] [2022-11-21 16:14:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 16:14:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 16:14:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:44,979 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-21 16:14:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:44,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071257379] [2022-11-21 16:14:44,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071257379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:44,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:44,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:14:44,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830464888] [2022-11-21 16:14:44,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:44,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:14:44,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:14:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:14:44,984 INFO L87 Difference]: Start difference. First operand 2440 states and 3308 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-21 16:14:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:47,808 INFO L93 Difference]: Finished difference Result 6012 states and 8182 transitions. [2022-11-21 16:14:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 16:14:47,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-11-21 16:14:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:47,829 INFO L225 Difference]: With dead ends: 6012 [2022-11-21 16:14:47,829 INFO L226 Difference]: Without dead ends: 2831 [2022-11-21 16:14:47,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-21 16:14:47,838 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 2057 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2079 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:47,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2079 Valid, 1712 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-21 16:14:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-11-21 16:14:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2651. [2022-11-21 16:14:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2093 states have (on average 1.3325370281892022) internal successors, (2789), 2136 states have internal predecessors, (2789), 316 states have call successors, (316), 206 states have call predecessors, (316), 240 states have return successors, (415), 312 states have call predecessors, (415), 312 states have call successors, (415) [2022-11-21 16:14:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3520 transitions. [2022-11-21 16:14:48,320 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3520 transitions. Word has length 66 [2022-11-21 16:14:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:48,321 INFO L495 AbstractCegarLoop]: Abstraction has 2651 states and 3520 transitions. [2022-11-21 16:14:48,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-21 16:14:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3520 transitions. [2022-11-21 16:14:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-21 16:14:48,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:48,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:48,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:14:48,329 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash 457439213, now seen corresponding path program 1 times [2022-11-21 16:14:48,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:48,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407402420] [2022-11-21 16:14:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:14:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:14:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:14:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 16:14:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:48,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407402420] [2022-11-21 16:14:48,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407402420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:48,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:48,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:14:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464677477] [2022-11-21 16:14:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:48,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:14:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:14:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:14:48,636 INFO L87 Difference]: Start difference. First operand 2651 states and 3520 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:14:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:49,928 INFO L93 Difference]: Finished difference Result 4476 states and 5922 transitions. [2022-11-21 16:14:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:14:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-11-21 16:14:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:49,947 INFO L225 Difference]: With dead ends: 4476 [2022-11-21 16:14:49,947 INFO L226 Difference]: Without dead ends: 2845 [2022-11-21 16:14:49,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:14:49,953 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 227 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:49,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1263 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:14:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2022-11-21 16:14:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2711. [2022-11-21 16:14:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2141 states have (on average 1.3222793087342364) internal successors, (2831), 2184 states have internal predecessors, (2831), 316 states have call successors, (316), 206 states have call predecessors, (316), 252 states have return successors, (427), 324 states have call predecessors, (427), 312 states have call successors, (427) [2022-11-21 16:14:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3574 transitions. [2022-11-21 16:14:50,346 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3574 transitions. Word has length 91 [2022-11-21 16:14:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:50,347 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 3574 transitions. [2022-11-21 16:14:50,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:14:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3574 transitions. [2022-11-21 16:14:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-21 16:14:50,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:50,351 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:50,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:14:50,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 901339887, now seen corresponding path program 1 times [2022-11-21 16:14:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290052686] [2022-11-21 16:14:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:14:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:14:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:14:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:14:50,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:50,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290052686] [2022-11-21 16:14:50,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290052686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:50,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:50,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:14:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465386726] [2022-11-21 16:14:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:50,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:14:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:14:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:14:50,489 INFO L87 Difference]: Start difference. First operand 2711 states and 3574 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:14:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:51,710 INFO L93 Difference]: Finished difference Result 6308 states and 8282 transitions. [2022-11-21 16:14:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:14:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-21 16:14:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:51,737 INFO L225 Difference]: With dead ends: 6308 [2022-11-21 16:14:51,737 INFO L226 Difference]: Without dead ends: 4618 [2022-11-21 16:14:51,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:14:51,745 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 800 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:51,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 581 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:14:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2022-11-21 16:14:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4398. [2022-11-21 16:14:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 3455 states have (on average 1.2931982633863965) internal successors, (4468), 3532 states have internal predecessors, (4468), 505 states have call successors, (505), 338 states have call predecessors, (505), 436 states have return successors, (759), 533 states have call predecessors, (759), 501 states have call successors, (759) [2022-11-21 16:14:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 5732 transitions. [2022-11-21 16:14:52,495 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 5732 transitions. Word has length 91 [2022-11-21 16:14:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:52,495 INFO L495 AbstractCegarLoop]: Abstraction has 4398 states and 5732 transitions. [2022-11-21 16:14:52,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-21 16:14:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 5732 transitions. [2022-11-21 16:14:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-21 16:14:52,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:52,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:52,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:14:52,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -156498191, now seen corresponding path program 1 times [2022-11-21 16:14:52,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:52,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627482639] [2022-11-21 16:14:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:52,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:14:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:14:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:14:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 16:14:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:52,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627482639] [2022-11-21 16:14:52,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627482639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:52,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:52,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:14:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252268035] [2022-11-21 16:14:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:52,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:14:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:14:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:14:52,598 INFO L87 Difference]: Start difference. First operand 4398 states and 5732 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:14:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:53,446 INFO L93 Difference]: Finished difference Result 6206 states and 8000 transitions. [2022-11-21 16:14:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:14:53,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-11-21 16:14:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:53,465 INFO L225 Difference]: With dead ends: 6206 [2022-11-21 16:14:53,465 INFO L226 Difference]: Without dead ends: 2829 [2022-11-21 16:14:53,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:14:53,475 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 442 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:53,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 541 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:14:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-11-21 16:14:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2711. [2022-11-21 16:14:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2141 states have (on average 1.3021952358710882) internal successors, (2788), 2184 states have internal predecessors, (2788), 316 states have call successors, (316), 206 states have call predecessors, (316), 252 states have return successors, (427), 324 states have call predecessors, (427), 312 states have call successors, (427) [2022-11-21 16:14:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3531 transitions. [2022-11-21 16:14:53,818 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3531 transitions. Word has length 91 [2022-11-21 16:14:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:53,818 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 3531 transitions. [2022-11-21 16:14:53,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 16:14:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3531 transitions. [2022-11-21 16:14:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-21 16:14:53,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:53,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:53,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:14:53,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 435090271, now seen corresponding path program 1 times [2022-11-21 16:14:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630993820] [2022-11-21 16:14:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:14:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 16:14:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:14:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-21 16:14:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:14:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 16:14:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:14:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:54,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630993820] [2022-11-21 16:14:54,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630993820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:54,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:14:54,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:14:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030128762] [2022-11-21 16:14:54,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:54,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:14:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:14:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:14:54,009 INFO L87 Difference]: Start difference. First operand 2711 states and 3531 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-21 16:14:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:55,994 INFO L93 Difference]: Finished difference Result 5520 states and 7110 transitions. [2022-11-21 16:14:55,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 16:14:55,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-11-21 16:14:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:56,014 INFO L225 Difference]: With dead ends: 5520 [2022-11-21 16:14:56,014 INFO L226 Difference]: Without dead ends: 3525 [2022-11-21 16:14:56,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-21 16:14:56,021 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 1260 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:56,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1085 Invalid, 1473 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [353 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 16:14:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-11-21 16:14:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3348. [2022-11-21 16:14:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 2619 states have (on average 1.272241313478427) internal successors, (3332), 2671 states have internal predecessors, (3332), 395 states have call successors, (395), 255 states have call predecessors, (395), 332 states have return successors, (563), 425 states have call predecessors, (563), 391 states have call successors, (563) [2022-11-21 16:14:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4290 transitions. [2022-11-21 16:14:56,613 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4290 transitions. Word has length 92 [2022-11-21 16:14:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:56,614 INFO L495 AbstractCegarLoop]: Abstraction has 3348 states and 4290 transitions. [2022-11-21 16:14:56,614 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-21 16:14:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4290 transitions. [2022-11-21 16:14:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-21 16:14:56,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:56,618 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-21 16:14:56,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:14:56,619 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:56,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1866213314, now seen corresponding path program 1 times [2022-11-21 16:14:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:56,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534389385] [2022-11-21 16:14:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:14:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:14:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:14:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:14:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:14:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-21 16:14:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,798 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-21 16:14:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:56,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534389385] [2022-11-21 16:14:56,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534389385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:14:56,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901901693] [2022-11-21 16:14:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:56,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:14:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:14:56,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:14:56,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:14:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:56,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:14:56,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:14:57,051 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-21 16:14:57,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:14:57,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901901693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:57,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:14:57,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 16:14:57,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574220216] [2022-11-21 16:14:57,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:57,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:57,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:57,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:57,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:14:57,072 INFO L87 Difference]: Start difference. First operand 3348 states and 4290 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-21 16:14:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:57,716 INFO L93 Difference]: Finished difference Result 5241 states and 6949 transitions. [2022-11-21 16:14:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:57,717 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-21 16:14:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:57,735 INFO L225 Difference]: With dead ends: 5241 [2022-11-21 16:14:57,735 INFO L226 Difference]: Without dead ends: 3594 [2022-11-21 16:14:57,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:14:57,742 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 113 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 678 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-21 16:14:57,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 678 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-11-21 16:14:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3594. [2022-11-21 16:14:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 2817 states have (on average 1.2765353212637558) internal successors, (3596), 2871 states have internal predecessors, (3596), 423 states have call successors, (423), 273 states have call predecessors, (423), 352 states have return successors, (605), 453 states have call predecessors, (605), 419 states have call successors, (605) [2022-11-21 16:14:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 4624 transitions. [2022-11-21 16:14:58,248 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 4624 transitions. Word has length 93 [2022-11-21 16:14:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:58,248 INFO L495 AbstractCegarLoop]: Abstraction has 3594 states and 4624 transitions. [2022-11-21 16:14:58,249 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-21 16:14:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 4624 transitions. [2022-11-21 16:14:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-21 16:14:58,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:58,253 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-21 16:14:58,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:14:58,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 16:14:58,460 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:14:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -287830492, now seen corresponding path program 1 times [2022-11-21 16:14:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089232587] [2022-11-21 16:14:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:14:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:14:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:14:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:14:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:14:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:14:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:14:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-21 16:14:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:14:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:14:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,650 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-21 16:14:58,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:58,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089232587] [2022-11-21 16:14:58,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089232587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:14:58,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237839302] [2022-11-21 16:14:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:58,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:14:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:14:58,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:14:58,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:14:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:58,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:14:58,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:14:58,971 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-21 16:14:58,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:14:58,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237839302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:14:58,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:14:58,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-21 16:14:58,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887715837] [2022-11-21 16:14:58,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:14:58,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:14:58,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:58,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:14:58,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:14:58,974 INFO L87 Difference]: Start difference. First operand 3594 states and 4624 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-21 16:14:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:59,506 INFO L93 Difference]: Finished difference Result 5345 states and 7099 transitions. [2022-11-21 16:14:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:14:59,507 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-21 16:14:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:59,545 INFO L225 Difference]: With dead ends: 5345 [2022-11-21 16:14:59,545 INFO L226 Difference]: Without dead ends: 4330 [2022-11-21 16:14:59,552 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-21 16:14:59,553 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 223 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 456 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-21 16:14:59,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 456 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:14:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2022-11-21 16:15:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4302. [2022-11-21 16:15:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 3390 states have (on average 1.2926253687315634) internal successors, (4382), 3453 states have internal predecessors, (4382), 501 states have call successors, (501), 324 states have call predecessors, (501), 409 states have return successors, (709), 528 states have call predecessors, (709), 497 states have call successors, (709) [2022-11-21 16:15:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5592 transitions. [2022-11-21 16:15:00,173 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5592 transitions. Word has length 119 [2022-11-21 16:15:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:00,174 INFO L495 AbstractCegarLoop]: Abstraction has 4302 states and 5592 transitions. [2022-11-21 16:15:00,174 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-21 16:15:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5592 transitions. [2022-11-21 16:15:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-21 16:15:00,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:00,180 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-21 16:15:00,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 16:15:00,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 16:15:00,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1068470771, now seen corresponding path program 1 times [2022-11-21 16:15:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:00,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769925998] [2022-11-21 16:15:00,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:00,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 16:15:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:15:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:15:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,570 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-21 16:15:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:00,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769925998] [2022-11-21 16:15:00,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769925998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:00,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743128357] [2022-11-21 16:15:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:00,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:00,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:00,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:00,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:15:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:00,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:15:00,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:00,763 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-21 16:15:00,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:15:00,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743128357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:00,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:15:00,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 16:15:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378838495] [2022-11-21 16:15:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:00,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:15:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:15:00,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:15:00,766 INFO L87 Difference]: Start difference. First operand 4302 states and 5592 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-21 16:15:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:01,543 INFO L93 Difference]: Finished difference Result 6564 states and 8764 transitions. [2022-11-21 16:15:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:15:01,544 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-21 16:15:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:01,570 INFO L225 Difference]: With dead ends: 6564 [2022-11-21 16:15:01,571 INFO L226 Difference]: Without dead ends: 4608 [2022-11-21 16:15:01,579 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-21 16:15:01,580 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 274 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 321 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-21 16:15:01,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 321 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2022-11-21 16:15:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4542. [2022-11-21 16:15:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4542 states, 3609 states have (on average 1.2618453865336658) internal successors, (4554), 3669 states have internal predecessors, (4554), 501 states have call successors, (501), 342 states have call predecessors, (501), 430 states have return successors, (703), 534 states have call predecessors, (703), 497 states have call successors, (703) [2022-11-21 16:15:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 5758 transitions. [2022-11-21 16:15:02,392 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 5758 transitions. Word has length 135 [2022-11-21 16:15:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:02,393 INFO L495 AbstractCegarLoop]: Abstraction has 4542 states and 5758 transitions. [2022-11-21 16:15:02,393 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-21 16:15:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 5758 transitions. [2022-11-21 16:15:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-21 16:15:02,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:02,400 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-21 16:15:02,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:15:02,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 16:15:02,607 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1809607182, now seen corresponding path program 1 times [2022-11-21 16:15:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:02,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285293217] [2022-11-21 16:15:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:02,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 16:15:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 16:15:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:15:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:15:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,832 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-21 16:15:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285293217] [2022-11-21 16:15:02,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285293217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865050099] [2022-11-21 16:15:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:02,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:02,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:02,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:02,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:15:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:02,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:15:02,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:03,019 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-21 16:15:03,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:15:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865050099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:03,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:15:03,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 16:15:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441594443] [2022-11-21 16:15:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:03,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:15:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:15:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:15:03,022 INFO L87 Difference]: Start difference. First operand 4542 states and 5758 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-21 16:15:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:03,663 INFO L93 Difference]: Finished difference Result 6787 states and 8719 transitions. [2022-11-21 16:15:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:15:03,664 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-21 16:15:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:03,682 INFO L225 Difference]: With dead ends: 6787 [2022-11-21 16:15:03,682 INFO L226 Difference]: Without dead ends: 4593 [2022-11-21 16:15:03,691 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-21 16:15:03,691 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 262 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 444 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-21 16:15:03,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 444 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-11-21 16:15:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4524. [2022-11-21 16:15:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 3591 states have (on average 1.2481203007518797) internal successors, (4482), 3651 states have internal predecessors, (4482), 501 states have call successors, (501), 342 states have call predecessors, (501), 430 states have return successors, (703), 534 states have call predecessors, (703), 497 states have call successors, (703) [2022-11-21 16:15:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5686 transitions. [2022-11-21 16:15:04,457 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5686 transitions. Word has length 135 [2022-11-21 16:15:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:04,457 INFO L495 AbstractCegarLoop]: Abstraction has 4524 states and 5686 transitions. [2022-11-21 16:15:04,458 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-21 16:15:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5686 transitions. [2022-11-21 16:15:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-21 16:15:04,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:04,464 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-21 16:15:04,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:15:04,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:15:04,672 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1867127916, now seen corresponding path program 1 times [2022-11-21 16:15:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:04,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949847439] [2022-11-21 16:15:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:15:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 16:15:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:04,868 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-21 16:15:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:04,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949847439] [2022-11-21 16:15:04,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949847439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:04,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052751856] [2022-11-21 16:15:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:04,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:04,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:04,870 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:04,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:15:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:05,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:15:05,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:05,120 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-21 16:15:05,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:15:05,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052751856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:05,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:15:05,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 16:15:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042526751] [2022-11-21 16:15:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:05,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:15:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:15:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:15:05,124 INFO L87 Difference]: Start difference. First operand 4524 states and 5686 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-21 16:15:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:05,651 INFO L93 Difference]: Finished difference Result 5468 states and 6974 transitions. [2022-11-21 16:15:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:15:05,652 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-21 16:15:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:05,669 INFO L225 Difference]: With dead ends: 5468 [2022-11-21 16:15:05,669 INFO L226 Difference]: Without dead ends: 4360 [2022-11-21 16:15:05,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:15:05,676 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 87 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 677 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-21 16:15:05,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 677 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2022-11-21 16:15:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4320. [2022-11-21 16:15:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4320 states, 3429 states have (on average 1.2379702537182853) internal successors, (4245), 3487 states have internal predecessors, (4245), 479 states have call successors, (479), 327 states have call predecessors, (479), 410 states have return successors, (663), 509 states have call predecessors, (663), 475 states have call successors, (663) [2022-11-21 16:15:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 5387 transitions. [2022-11-21 16:15:06,362 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 5387 transitions. Word has length 136 [2022-11-21 16:15:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:06,362 INFO L495 AbstractCegarLoop]: Abstraction has 4320 states and 5387 transitions. [2022-11-21 16:15:06,363 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-21 16:15:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 5387 transitions. [2022-11-21 16:15:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 16:15:06,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:06,369 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-21 16:15:06,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:15:06,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:06,577 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -895196586, now seen corresponding path program 1 times [2022-11-21 16:15:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:06,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121852327] [2022-11-21 16:15:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:15:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:15:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,756 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-21 16:15:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:06,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121852327] [2022-11-21 16:15:06,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121852327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:06,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115774121] [2022-11-21 16:15:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:06,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:06,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:15:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:06,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:15:06,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:07,057 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-21 16:15:07,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:15:07,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115774121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:07,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:15:07,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-21 16:15:07,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513440303] [2022-11-21 16:15:07,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:15:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:15:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:15:07,062 INFO L87 Difference]: Start difference. First operand 4320 states and 5387 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-21 16:15:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:08,326 INFO L93 Difference]: Finished difference Result 5678 states and 7141 transitions. [2022-11-21 16:15:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:15:08,327 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-21 16:15:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:08,346 INFO L225 Difference]: With dead ends: 5678 [2022-11-21 16:15:08,346 INFO L226 Difference]: Without dead ends: 4313 [2022-11-21 16:15:08,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:15:08,354 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 330 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:08,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 444 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:15:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2022-11-21 16:15:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 3744. [2022-11-21 16:15:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 2961 states have (on average 1.2228976697061804) internal successors, (3621), 3009 states have internal predecessors, (3621), 421 states have call successors, (421), 284 states have call predecessors, (421), 360 states have return successors, (571), 453 states have call predecessors, (571), 417 states have call successors, (571) [2022-11-21 16:15:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 4613 transitions. [2022-11-21 16:15:09,041 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 4613 transitions. Word has length 137 [2022-11-21 16:15:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:09,041 INFO L495 AbstractCegarLoop]: Abstraction has 3744 states and 4613 transitions. [2022-11-21 16:15:09,041 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-21 16:15:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 4613 transitions. [2022-11-21 16:15:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 16:15:09,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:09,053 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-21 16:15:09,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:15:09,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:09,259 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1533062036, now seen corresponding path program 1 times [2022-11-21 16:15:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:09,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238427261] [2022-11-21 16:15:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:15:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:15:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,451 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-21 16:15:09,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238427261] [2022-11-21 16:15:09,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238427261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198132967] [2022-11-21 16:15:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:09,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:09,454 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:09,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:15:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:09,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:15:09,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:09,703 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-21 16:15:09,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:15:09,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198132967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:09,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:15:09,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-21 16:15:09,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133229283] [2022-11-21 16:15:09,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:09,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:15:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:09,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:15:09,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:15:09,709 INFO L87 Difference]: Start difference. First operand 3744 states and 4613 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-21 16:15:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:10,600 INFO L93 Difference]: Finished difference Result 4876 states and 6006 transitions. [2022-11-21 16:15:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:15:10,601 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-21 16:15:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:10,608 INFO L225 Difference]: With dead ends: 4876 [2022-11-21 16:15:10,608 INFO L226 Difference]: Without dead ends: 3480 [2022-11-21 16:15:10,611 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-21 16:15:10,612 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 352 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:10,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 440 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:15:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2022-11-21 16:15:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3458. [2022-11-21 16:15:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2733 states have (on average 1.2034394438346139) internal successors, (3289), 2777 states have internal predecessors, (3289), 383 states have call successors, (383), 262 states have call predecessors, (383), 340 states have return successors, (522), 421 states have call predecessors, (522), 379 states have call successors, (522) [2022-11-21 16:15:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4194 transitions. [2022-11-21 16:15:11,046 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4194 transitions. Word has length 137 [2022-11-21 16:15:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:11,046 INFO L495 AbstractCegarLoop]: Abstraction has 3458 states and 4194 transitions. [2022-11-21 16:15:11,046 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-21 16:15:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4194 transitions. [2022-11-21 16:15:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 16:15:11,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:11,051 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-21 16:15:11,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:15:11,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 16:15:11,258 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash 225919638, now seen corresponding path program 1 times [2022-11-21 16:15:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:11,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031984385] [2022-11-21 16:15:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:11,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:15:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:15:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,439 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-21 16:15:11,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:11,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031984385] [2022-11-21 16:15:11,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031984385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:15:11,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974421560] [2022-11-21 16:15:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:11,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:15:11,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:15:11,441 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:15:11,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:15:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:11,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:15:11,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:15:11,653 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-21 16:15:11,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:15:11,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974421560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:11,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:15:11,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-21 16:15:11,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803304197] [2022-11-21 16:15:11,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:11,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:15:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:15:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:15:11,657 INFO L87 Difference]: Start difference. First operand 3458 states and 4194 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-21 16:15:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:12,379 INFO L93 Difference]: Finished difference Result 4597 states and 5591 transitions. [2022-11-21 16:15:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:15:12,380 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-21 16:15:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:12,393 INFO L225 Difference]: With dead ends: 4597 [2022-11-21 16:15:12,394 INFO L226 Difference]: Without dead ends: 3486 [2022-11-21 16:15:12,398 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-21 16:15:12,400 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 10 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:12,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1151 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:15:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2022-11-21 16:15:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3470. [2022-11-21 16:15:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 2745 states have (on average 1.1948998178506376) internal successors, (3280), 2789 states have internal predecessors, (3280), 383 states have call successors, (383), 262 states have call predecessors, (383), 340 states have return successors, (522), 421 states have call predecessors, (522), 379 states have call successors, (522) [2022-11-21 16:15:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4185 transitions. [2022-11-21 16:15:13,025 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4185 transitions. Word has length 137 [2022-11-21 16:15:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:13,025 INFO L495 AbstractCegarLoop]: Abstraction has 3470 states and 4185 transitions. [2022-11-21 16:15:13,025 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-21 16:15:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4185 transitions. [2022-11-21 16:15:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 16:15:13,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:13,029 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-21 16:15:13,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:15:13,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 16:15:13,237 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1775392230, now seen corresponding path program 1 times [2022-11-21 16:15:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:13,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530959994] [2022-11-21 16:15:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:15:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:15:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:13,458 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-21 16:15:13,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:13,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530959994] [2022-11-21 16:15:13,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530959994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:13,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:13,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:15:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816885964] [2022-11-21 16:15:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:13,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:15:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:13,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:15:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:15:13,461 INFO L87 Difference]: Start difference. First operand 3470 states and 4185 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-21 16:15:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:15,161 INFO L93 Difference]: Finished difference Result 4448 states and 5284 transitions. [2022-11-21 16:15:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:15:15,161 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-21 16:15:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:15,177 INFO L225 Difference]: With dead ends: 4448 [2022-11-21 16:15:15,177 INFO L226 Difference]: Without dead ends: 4445 [2022-11-21 16:15:15,180 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-21 16:15:15,181 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 737 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:15,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 738 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:15:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2022-11-21 16:15:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4174. [2022-11-21 16:15:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4174 states, 3325 states have (on average 1.1819548872180452) internal successors, (3930), 3375 states have internal predecessors, (3930), 451 states have call successors, (451), 310 states have call predecessors, (451), 396 states have return successors, (601), 491 states have call predecessors, (601), 447 states have call successors, (601) [2022-11-21 16:15:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 4982 transitions. [2022-11-21 16:15:15,893 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 4982 transitions. Word has length 137 [2022-11-21 16:15:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:15,894 INFO L495 AbstractCegarLoop]: Abstraction has 4174 states and 4982 transitions. [2022-11-21 16:15:15,894 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-21 16:15:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 4982 transitions. [2022-11-21 16:15:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-21 16:15:15,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:15,898 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-21 16:15:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 16:15:15,899 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:15,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1319300478, now seen corresponding path program 1 times [2022-11-21 16:15:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118239723] [2022-11-21 16:15:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:15:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:15:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:15:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:15:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:15:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 16:15:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:15:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:15:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:15:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:15:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:15:16,002 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-21 16:15:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:15:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118239723] [2022-11-21 16:15:16,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118239723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:15:16,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:15:16,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:15:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544778168] [2022-11-21 16:15:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:15:16,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:15:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:15:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:15:16,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:15:16,005 INFO L87 Difference]: Start difference. First operand 4174 states and 4982 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-21 16:15:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:15:17,246 INFO L93 Difference]: Finished difference Result 5929 states and 7136 transitions. [2022-11-21 16:15:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:15:17,247 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-21 16:15:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:15:17,264 INFO L225 Difference]: With dead ends: 5929 [2022-11-21 16:15:17,265 INFO L226 Difference]: Without dead ends: 4691 [2022-11-21 16:15:17,270 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-21 16:15:17,271 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 254 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:15:17,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 721 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:15:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-11-21 16:15:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4176. [2022-11-21 16:15:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3327 states have (on average 1.1818455064622784) internal successors, (3932), 3377 states have internal predecessors, (3932), 451 states have call successors, (451), 310 states have call predecessors, (451), 396 states have return successors, (601), 491 states have call predecessors, (601), 447 states have call successors, (601) [2022-11-21 16:15:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 4984 transitions. [2022-11-21 16:15:17,885 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 4984 transitions. Word has length 141 [2022-11-21 16:15:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:15:17,885 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 4984 transitions. [2022-11-21 16:15:17,886 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-21 16:15:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 4984 transitions. [2022-11-21 16:15:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-21 16:15:17,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:15:17,890 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-21 16:15:17,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 16:15:17,891 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:15:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:15:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1014498838, now seen corresponding path program 1 times [2022-11-21 16:15:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:15:17,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540133399] [2022-11-21 16:15:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:15:17,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:15:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:15:17,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:15:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:15:17,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:15:17,994 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:15:17,995 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-21 16:15:17,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-21 16:15:17,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 16:15:18,001 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:15:18,006 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:15:18,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:15:18 BoogieIcfgContainer [2022-11-21 16:15:18,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:15:18,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:15:18,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:15:18,176 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:15:18,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:14:27" (3/4) ... [2022-11-21 16:15:18,179 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:15:18,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:15:18,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:15:18,349 INFO L158 Benchmark]: Toolchain (without parser) took 52357.49ms. Allocated memory was 172.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 139.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. [2022-11-21 16:15:18,350 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 141.6MB in the end (delta: 85.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:15:18,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.37ms. Allocated memory is still 172.0MB. Free memory was 139.0MB in the beginning and 121.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 16:15:18,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.96ms. Allocated memory is still 172.0MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:15:18,351 INFO L158 Benchmark]: Boogie Preprocessor took 59.63ms. Allocated memory is still 172.0MB. Free memory was 118.9MB in the beginning and 116.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:15:18,351 INFO L158 Benchmark]: RCFGBuilder took 1194.91ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 87.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-21 16:15:18,352 INFO L158 Benchmark]: TraceAbstraction took 50424.44ms. Allocated memory was 172.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 86.3MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2022-11-21 16:15:18,352 INFO L158 Benchmark]: Witness Printer took 173.29ms. Allocated memory is still 2.1GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 16:15:18,354 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.25ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 141.6MB in the end (delta: 85.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.37ms. Allocated memory is still 172.0MB. Free memory was 139.0MB in the beginning and 121.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.96ms. Allocated memory is still 172.0MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.63ms. Allocated memory is still 172.0MB. Free memory was 118.9MB in the beginning and 116.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1194.91ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 87.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50424.44ms. Allocated memory was 172.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 86.3MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. * Witness Printer took 173.29ms. Allocated memory is still 2.1GB. Free memory was 1.8GB in the beginning and 1.8GB 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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1012] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L850] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L855] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L860] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L865] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1014] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1015] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L727] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L746] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L1015] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1016] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L878] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L883] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L888] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L893] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1016] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1019] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L634] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L640] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L932] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L727] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L746] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L932] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L640] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L641] E_1 = 2 [L642] m_pc = 1 [L643] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L817] RET master() [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L682] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L698] token += 1 [L699] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L700] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L932] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L715] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L735] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L932] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L700] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L701] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L626] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L648] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L653] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L654] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L659] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L660] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L661] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L662] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L599] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 232 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 50.1s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14369 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14050 mSDsluCounter, 20585 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14502 mSDsCounter, 3209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14089 IncrementalHoareTripleChecker+Invalid, 17298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3209 mSolverCounterUnsat, 6083 mSDtfsCounter, 14089 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1806 GetRequests, 1491 SyntacticMatches, 2 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4542occurred in iteration=17, InterpolantAutomatonStates: 270, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 3240 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3460 NumberOfCodeBlocks, 3460 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3286 ConstructedInterpolants, 0 QuantifiedInterpolants, 5709 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3510 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1282/1357 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 16:15:18,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61a70f09-274b-4d40-94da-90ef6c4e0e62/bin/uautomizer-vX5HgA9Q3a/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