./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:24:38,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:24:38,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:24:38,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:24:38,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:24:38,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:24:38,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:24:38,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:24:38,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:24:38,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:24:38,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:24:38,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:24:38,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:24:38,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:24:38,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:24:38,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:24:38,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:24:38,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:24:38,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:24:38,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:24:38,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:24:38,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:24:38,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:24:38,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:24:38,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:24:38,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:24:38,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:24:38,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:24:38,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:24:38,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:24:38,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:24:38,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:24:38,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:24:38,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:24:38,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:24:38,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:24:38,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:24:38,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:24:38,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:24:38,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:24:38,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:24:38,958 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 23:24:38,977 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:24:38,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:24:38,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:24:38,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:24:38,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:24:38,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:24:38,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:24:38,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:24:38,979 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:24:38,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:24:38,979 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:24:38,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:24:38,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:24:38,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:24:38,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 23:24:38,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:24:38,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 23:24:38,980 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:24:38,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 23:24:38,981 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:24:38,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 23:24:38,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:24:38,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:24:38,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:24:38,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:24:38,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:24:38,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:24:38,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 23:24:38,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:24:38,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:24:38,982 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 23:24:38,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 23:24:38,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 23:24:38,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:24:38,983 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_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 [2021-12-06 23:24:39,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:24:39,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:24:39,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:24:39,194 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:24:39,195 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:24:39,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2021-12-06 23:24:39,244 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/data/2d3fe64f8/3ff48f5b21ab42a19dd6a871fb6495a1/FLAGe587409ab [2021-12-06 23:24:39,685 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:24:39,685 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2021-12-06 23:24:39,694 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/data/2d3fe64f8/3ff48f5b21ab42a19dd6a871fb6495a1/FLAGe587409ab [2021-12-06 23:24:39,704 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/data/2d3fe64f8/3ff48f5b21ab42a19dd6a871fb6495a1 [2021-12-06 23:24:39,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:24:39,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:24:39,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:24:39,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:24:39,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:24:39,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:24:39" (1/1) ... [2021-12-06 23:24:39,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa6b8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:39, skipping insertion in model container [2021-12-06 23:24:39,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:24:39" (1/1) ... [2021-12-06 23:24:39,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:24:39,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:24:39,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2021-12-06 23:24:39,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2021-12-06 23:24:39,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:24:39,969 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:24:39,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2021-12-06 23:24:39,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2021-12-06 23:24:40,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:24:40,045 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:24:40,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40 WrapperNode [2021-12-06 23:24:40,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:24:40,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:24:40,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:24:40,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:24:40,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,092 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 523 [2021-12-06 23:24:40,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:24:40,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:24:40,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:24:40,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:24:40,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:24:40,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:24:40,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:24:40,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:24:40,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (1/1) ... [2021-12-06 23:24:40,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:24:40,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:24:40,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:24:40,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:24:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:24:40,183 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 23:24:40,183 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 23:24:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 23:24:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 23:24:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 23:24:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 23:24:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 23:24:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 23:24:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 23:24:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 23:24:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 23:24:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 23:24:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 23:24:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 23:24:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 23:24:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 23:24:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 23:24:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 23:24:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 23:24:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 23:24:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 23:24:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 23:24:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:24:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 23:24:40,186 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 23:24:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 23:24:40,186 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 23:24:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:24:40,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:24:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 23:24:40,186 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 23:24:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-06 23:24:40,186 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-06 23:24:40,261 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:24:40,263 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:24:40,598 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:24:40,606 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:24:40,606 INFO L301 CfgBuilder]: Removed 10 assume(true) statements. [2021-12-06 23:24:40,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:24:40 BoogieIcfgContainer [2021-12-06 23:24:40,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:24:40,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:24:40,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:24:40,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:24:40,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:24:39" (1/3) ... [2021-12-06 23:24:40,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b613fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:24:40, skipping insertion in model container [2021-12-06 23:24:40,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:24:40" (2/3) ... [2021-12-06 23:24:40,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b613fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:24:40, skipping insertion in model container [2021-12-06 23:24:40,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:24:40" (3/3) ... [2021-12-06 23:24:40,614 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2021-12-06 23:24:40,618 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:24:40,618 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 23:24:40,654 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:24:40,660 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 23:24:40,660 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 23:24:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-06 23:24:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:24:40,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:40,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:40,693 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash 207768249, now seen corresponding path program 1 times [2021-12-06 23:24:40,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:40,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188720915] [2021-12-06 23:24:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:40,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:40,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:40,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188720915] [2021-12-06 23:24:40,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188720915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:40,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:40,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:24:40,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413162634] [2021-12-06 23:24:40,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:40,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:24:40,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:24:40,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:24:40,975 INFO L87 Difference]: Start difference. First operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 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 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:41,550 INFO L93 Difference]: Finished difference Result 647 states and 988 transitions. [2021-12-06 23:24:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:24:41,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 23:24:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:41,563 INFO L225 Difference]: With dead ends: 647 [2021-12-06 23:24:41,564 INFO L226 Difference]: Without dead ends: 390 [2021-12-06 23:24:41,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:24:41,570 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 668 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:41,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 1144 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:24:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-06 23:24:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 351. [2021-12-06 23:24:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2021-12-06 23:24:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 502 transitions. [2021-12-06 23:24:41,633 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 502 transitions. Word has length 65 [2021-12-06 23:24:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:41,634 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 502 transitions. [2021-12-06 23:24:41,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 502 transitions. [2021-12-06 23:24:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:24:41,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:41,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:41,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:24:41,638 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1886656889, now seen corresponding path program 1 times [2021-12-06 23:24:41,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:41,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089220581] [2021-12-06 23:24:41,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:41,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:41,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:41,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089220581] [2021-12-06 23:24:41,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089220581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:41,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:41,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:24:41,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705676444] [2021-12-06 23:24:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:41,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:24:41,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:24:41,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:24:41,750 INFO L87 Difference]: Start difference. First operand 351 states and 502 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:42,295 INFO L93 Difference]: Finished difference Result 698 states and 979 transitions. [2021-12-06 23:24:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 23:24:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 23:24:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:42,301 INFO L225 Difference]: With dead ends: 698 [2021-12-06 23:24:42,301 INFO L226 Difference]: Without dead ends: 521 [2021-12-06 23:24:42,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 23:24:42,303 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 697 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:42,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [719 Valid, 1599 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:24:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-12-06 23:24:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 447. [2021-12-06 23:24:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2021-12-06 23:24:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 636 transitions. [2021-12-06 23:24:42,345 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 636 transitions. Word has length 65 [2021-12-06 23:24:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:42,345 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 636 transitions. [2021-12-06 23:24:42,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 636 transitions. [2021-12-06 23:24:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:24:42,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:42,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:42,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:24:42,349 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -141929221, now seen corresponding path program 1 times [2021-12-06 23:24:42,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:42,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350812837] [2021-12-06 23:24:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:42,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:42,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:42,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350812837] [2021-12-06 23:24:42,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350812837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:42,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:42,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:24:42,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323047057] [2021-12-06 23:24:42,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:42,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:24:42,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:42,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:24:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:24:42,464 INFO L87 Difference]: Start difference. First operand 447 states and 636 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:42,904 INFO L93 Difference]: Finished difference Result 748 states and 1050 transitions. [2021-12-06 23:24:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:24:42,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-06 23:24:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:42,909 INFO L225 Difference]: With dead ends: 748 [2021-12-06 23:24:42,909 INFO L226 Difference]: Without dead ends: 481 [2021-12-06 23:24:42,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 23:24:42,912 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 292 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:42,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 1779 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:24:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-12-06 23:24:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 452. [2021-12-06 23:24:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2021-12-06 23:24:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 639 transitions. [2021-12-06 23:24:42,954 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 639 transitions. Word has length 65 [2021-12-06 23:24:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:42,955 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 639 transitions. [2021-12-06 23:24:42,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 639 transitions. [2021-12-06 23:24:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:24:42,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:42,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:42,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:24:42,959 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1171288519, now seen corresponding path program 1 times [2021-12-06 23:24:42,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:42,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491346009] [2021-12-06 23:24:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:42,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:43,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:43,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491346009] [2021-12-06 23:24:43,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491346009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:43,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:43,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:24:43,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622692206] [2021-12-06 23:24:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:43,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:24:43,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:24:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:24:43,074 INFO L87 Difference]: Start difference. First operand 452 states and 639 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:43,483 INFO L93 Difference]: Finished difference Result 770 states and 1072 transitions. [2021-12-06 23:24:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:24:43,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-06 23:24:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:43,486 INFO L225 Difference]: With dead ends: 770 [2021-12-06 23:24:43,486 INFO L226 Difference]: Without dead ends: 498 [2021-12-06 23:24:43,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:24:43,488 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 432 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:43,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1605 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:24:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-12-06 23:24:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 467. [2021-12-06 23:24:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2021-12-06 23:24:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2021-12-06 23:24:43,511 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 65 [2021-12-06 23:24:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:43,512 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2021-12-06 23:24:43,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2021-12-06 23:24:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:24:43,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:43,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:43,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:24:43,514 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash 214914875, now seen corresponding path program 1 times [2021-12-06 23:24:43,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:43,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011629846] [2021-12-06 23:24:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:43,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:43,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:43,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011629846] [2021-12-06 23:24:43,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011629846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:43,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:43,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:24:43,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802537558] [2021-12-06 23:24:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:43,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:24:43,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:24:43,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:24:43,595 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:44,086 INFO L93 Difference]: Finished difference Result 859 states and 1165 transitions. [2021-12-06 23:24:44,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 23:24:44,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 23:24:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:44,091 INFO L225 Difference]: With dead ends: 859 [2021-12-06 23:24:44,091 INFO L226 Difference]: Without dead ends: 574 [2021-12-06 23:24:44,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-06 23:24:44,093 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 887 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:44,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 1176 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:24:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-12-06 23:24:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 479. [2021-12-06 23:24:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2021-12-06 23:24:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 664 transitions. [2021-12-06 23:24:44,126 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 664 transitions. Word has length 65 [2021-12-06 23:24:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:44,126 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 664 transitions. [2021-12-06 23:24:44,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 664 transitions. [2021-12-06 23:24:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 23:24:44,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:44,128 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:44,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 23:24:44,129 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:44,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 80901369, now seen corresponding path program 1 times [2021-12-06 23:24:44,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:44,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946107225] [2021-12-06 23:24:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:44,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:44,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:44,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946107225] [2021-12-06 23:24:44,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946107225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:44,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:44,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:44,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984859546] [2021-12-06 23:24:44,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:44,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:44,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:44,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:44,206 INFO L87 Difference]: Start difference. First operand 479 states and 664 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:44,488 INFO L93 Difference]: Finished difference Result 1121 states and 1511 transitions. [2021-12-06 23:24:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 23:24:44,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 23:24:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:44,494 INFO L225 Difference]: With dead ends: 1121 [2021-12-06 23:24:44,494 INFO L226 Difference]: Without dead ends: 825 [2021-12-06 23:24:44,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-06 23:24:44,497 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1050 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:44,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1074 Valid, 731 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:24:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-12-06 23:24:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 769. [2021-12-06 23:24:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2021-12-06 23:24:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1043 transitions. [2021-12-06 23:24:44,541 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1043 transitions. Word has length 65 [2021-12-06 23:24:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:44,542 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1043 transitions. [2021-12-06 23:24:44,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 23:24:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1043 transitions. [2021-12-06 23:24:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 23:24:44,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:44,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:44,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 23:24:44,549 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1103860140, now seen corresponding path program 1 times [2021-12-06 23:24:44,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:44,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986240854] [2021-12-06 23:24:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:44,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:44,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:44,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986240854] [2021-12-06 23:24:44,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986240854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:44,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:44,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:24:44,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214709833] [2021-12-06 23:24:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:44,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:24:44,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:24:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:24:44,618 INFO L87 Difference]: Start difference. First operand 769 states and 1043 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:44,931 INFO L93 Difference]: Finished difference Result 1972 states and 2614 transitions. [2021-12-06 23:24:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:24:44,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-06 23:24:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:44,937 INFO L225 Difference]: With dead ends: 1972 [2021-12-06 23:24:44,938 INFO L226 Difference]: Without dead ends: 1365 [2021-12-06 23:24:44,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:24:44,940 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 653 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:44,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 877 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:24:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2021-12-06 23:24:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1250. [2021-12-06 23:24:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2021-12-06 23:24:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1641 transitions. [2021-12-06 23:24:44,992 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1641 transitions. Word has length 66 [2021-12-06 23:24:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:44,993 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1641 transitions. [2021-12-06 23:24:44,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1641 transitions. [2021-12-06 23:24:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 23:24:44,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:44,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:44,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 23:24:44,995 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash 354379519, now seen corresponding path program 1 times [2021-12-06 23:24:44,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:44,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512072015] [2021-12-06 23:24:44,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:44,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:45,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:45,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512072015] [2021-12-06 23:24:45,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512072015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:45,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:45,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:24:45,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115746564] [2021-12-06 23:24:45,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:45,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:24:45,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:45,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:24:45,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:24:45,048 INFO L87 Difference]: Start difference. First operand 1250 states and 1641 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:45,346 INFO L93 Difference]: Finished difference Result 3438 states and 4447 transitions. [2021-12-06 23:24:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:24:45,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-06 23:24:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:45,357 INFO L225 Difference]: With dead ends: 3438 [2021-12-06 23:24:45,357 INFO L226 Difference]: Without dead ends: 2370 [2021-12-06 23:24:45,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:24:45,367 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 873 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:45,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [897 Valid, 738 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:24:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2021-12-06 23:24:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2112. [2021-12-06 23:24:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2021-12-06 23:24:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2702 transitions. [2021-12-06 23:24:45,452 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2702 transitions. Word has length 66 [2021-12-06 23:24:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:45,453 INFO L470 AbstractCegarLoop]: Abstraction has 2112 states and 2702 transitions. [2021-12-06 23:24:45,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2702 transitions. [2021-12-06 23:24:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 23:24:45,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:45,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:45,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 23:24:45,456 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1353227277, now seen corresponding path program 1 times [2021-12-06 23:24:45,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:45,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313771924] [2021-12-06 23:24:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:45,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:45,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:45,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313771924] [2021-12-06 23:24:45,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313771924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:45,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:45,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:24:45,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425178319] [2021-12-06 23:24:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:45,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:24:45,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:45,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:24:45,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:24:45,518 INFO L87 Difference]: Start difference. First operand 2112 states and 2702 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:45,813 INFO L93 Difference]: Finished difference Result 5022 states and 6352 transitions. [2021-12-06 23:24:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:24:45,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2021-12-06 23:24:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:45,828 INFO L225 Difference]: With dead ends: 5022 [2021-12-06 23:24:45,828 INFO L226 Difference]: Without dead ends: 3092 [2021-12-06 23:24:45,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:24:45,833 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 854 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:45,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 774 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:24:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2021-12-06 23:24:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2844. [2021-12-06 23:24:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2021-12-06 23:24:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3595 transitions. [2021-12-06 23:24:45,945 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3595 transitions. Word has length 72 [2021-12-06 23:24:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:45,945 INFO L470 AbstractCegarLoop]: Abstraction has 2844 states and 3595 transitions. [2021-12-06 23:24:45,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:24:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3595 transitions. [2021-12-06 23:24:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 23:24:45,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:45,947 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:45,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:24:45,948 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash 483330199, now seen corresponding path program 1 times [2021-12-06 23:24:45,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:45,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197392010] [2021-12-06 23:24:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:45,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:46,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:46,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197392010] [2021-12-06 23:24:46,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197392010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:46,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:46,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:46,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161924944] [2021-12-06 23:24:46,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:46,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:46,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:46,009 INFO L87 Difference]: Start difference. First operand 2844 states and 3595 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 23:24:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:46,351 INFO L93 Difference]: Finished difference Result 3618 states and 4526 transitions. [2021-12-06 23:24:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:24:46,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2021-12-06 23:24:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:46,367 INFO L225 Difference]: With dead ends: 3618 [2021-12-06 23:24:46,367 INFO L226 Difference]: Without dead ends: 3615 [2021-12-06 23:24:46,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-06 23:24:46,369 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 1225 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:46,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 744 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:24:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2021-12-06 23:24:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3338. [2021-12-06 23:24:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2021-12-06 23:24:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 4196 transitions. [2021-12-06 23:24:46,518 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 4196 transitions. Word has length 73 [2021-12-06 23:24:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:46,519 INFO L470 AbstractCegarLoop]: Abstraction has 3338 states and 4196 transitions. [2021-12-06 23:24:46,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 23:24:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4196 transitions. [2021-12-06 23:24:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 23:24:46,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:46,521 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:46,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:24:46,521 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:46,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2097533117, now seen corresponding path program 1 times [2021-12-06 23:24:46,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:46,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069864541] [2021-12-06 23:24:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:46,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:46,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:46,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069864541] [2021-12-06 23:24:46,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069864541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:24:46,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305188574] [2021-12-06 23:24:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:46,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:24:46,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:24:46,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:24:46,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 23:24:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:46,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 23:24:46,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:24:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:46,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:24:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:47,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305188574] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:24:47,112 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:24:47,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-06 23:24:47,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059263091] [2021-12-06 23:24:47,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:24:47,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:24:47,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:24:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:24:47,114 INFO L87 Difference]: Start difference. First operand 3338 states and 4196 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 23:24:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:48,119 INFO L93 Difference]: Finished difference Result 7779 states and 9682 transitions. [2021-12-06 23:24:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 23:24:48,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2021-12-06 23:24:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:48,163 INFO L225 Difference]: With dead ends: 7779 [2021-12-06 23:24:48,163 INFO L226 Difference]: Without dead ends: 7776 [2021-12-06 23:24:48,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-06 23:24:48,167 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 1443 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:48,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1506 Valid, 1723 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 23:24:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2021-12-06 23:24:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 5128. [2021-12-06 23:24:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 4011 states have (on average 1.268511593118923) internal successors, (5088), 4075 states have internal predecessors, (5088), 548 states have call successors, (548), 452 states have call predecessors, (548), 567 states have return successors, (798), 607 states have call predecessors, (798), 545 states have call successors, (798) [2021-12-06 23:24:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 6434 transitions. [2021-12-06 23:24:48,432 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 6434 transitions. Word has length 74 [2021-12-06 23:24:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:48,433 INFO L470 AbstractCegarLoop]: Abstraction has 5128 states and 6434 transitions. [2021-12-06 23:24:48,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 23:24:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 6434 transitions. [2021-12-06 23:24:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-06 23:24:48,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:48,435 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:48,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 23:24:48,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 23:24:48,636 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash -863953769, now seen corresponding path program 2 times [2021-12-06 23:24:48,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:48,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125699832] [2021-12-06 23:24:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:48,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:24:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:24:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:24:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:24:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:24:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:24:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:48,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:48,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125699832] [2021-12-06 23:24:48,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125699832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:48,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:48,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:24:48,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066832940] [2021-12-06 23:24:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:48,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:24:48,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:24:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:24:48,697 INFO L87 Difference]: Start difference. First operand 5128 states and 6434 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 23:24:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:49,029 INFO L93 Difference]: Finished difference Result 7810 states and 9807 transitions. [2021-12-06 23:24:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:24:49,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2021-12-06 23:24:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:49,046 INFO L225 Difference]: With dead ends: 7810 [2021-12-06 23:24:49,046 INFO L226 Difference]: Without dead ends: 3735 [2021-12-06 23:24:49,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:24:49,067 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 741 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:49,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 865 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:24:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2021-12-06 23:24:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3500. [2021-12-06 23:24:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2739 states have (on average 1.2515516611902153) internal successors, (3428), 2781 states have internal predecessors, (3428), 380 states have call successors, (380), 308 states have call predecessors, (380), 379 states have return successors, (524), 417 states have call predecessors, (524), 377 states have call successors, (524) [2021-12-06 23:24:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4332 transitions. [2021-12-06 23:24:49,225 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4332 transitions. Word has length 77 [2021-12-06 23:24:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:49,226 INFO L470 AbstractCegarLoop]: Abstraction has 3500 states and 4332 transitions. [2021-12-06 23:24:49,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 23:24:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4332 transitions. [2021-12-06 23:24:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:49,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:49,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:49,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 23:24:49,230 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1029310995, now seen corresponding path program 1 times [2021-12-06 23:24:49,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:49,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869582649] [2021-12-06 23:24:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:49,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:49,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:49,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:49,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:49,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:49,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869582649] [2021-12-06 23:24:49,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869582649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:49,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:49,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:24:49,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270497497] [2021-12-06 23:24:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:49,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:24:49,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:24:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:24:49,287 INFO L87 Difference]: Start difference. First operand 3500 states and 4332 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:49,999 INFO L93 Difference]: Finished difference Result 3882 states and 4923 transitions. [2021-12-06 23:24:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:24:50,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:50,015 INFO L225 Difference]: With dead ends: 3882 [2021-12-06 23:24:50,015 INFO L226 Difference]: Without dead ends: 3734 [2021-12-06 23:24:50,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:24:50,018 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 752 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:50,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 1003 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:24:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2021-12-06 23:24:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3647. [2021-12-06 23:24:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3647 states, 2867 states have (on average 1.264387861876526) internal successors, (3625), 2910 states have internal predecessors, (3625), 392 states have call successors, (392), 314 states have call predecessors, (392), 386 states have return successors, (539), 429 states have call predecessors, (539), 389 states have call successors, (539) [2021-12-06 23:24:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 4556 transitions. [2021-12-06 23:24:50,208 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 4556 transitions. Word has length 80 [2021-12-06 23:24:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:50,208 INFO L470 AbstractCegarLoop]: Abstraction has 3647 states and 4556 transitions. [2021-12-06 23:24:50,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 4556 transitions. [2021-12-06 23:24:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:50,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:50,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:50,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 23:24:50,211 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash -212129521, now seen corresponding path program 1 times [2021-12-06 23:24:50,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:50,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723491740] [2021-12-06 23:24:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:50,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:50,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:50,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:50,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:50,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:50,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:50,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723491740] [2021-12-06 23:24:50,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723491740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:50,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:50,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:50,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229872189] [2021-12-06 23:24:50,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:50,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:50,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:50,267 INFO L87 Difference]: Start difference. First operand 3647 states and 4556 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:51,045 INFO L93 Difference]: Finished difference Result 4220 states and 5436 transitions. [2021-12-06 23:24:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:24:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:51,056 INFO L225 Difference]: With dead ends: 4220 [2021-12-06 23:24:51,056 INFO L226 Difference]: Without dead ends: 3925 [2021-12-06 23:24:51,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 23:24:51,058 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 743 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:51,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 1566 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:24:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2021-12-06 23:24:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3785. [2021-12-06 23:24:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 2986 states have (on average 1.2739450770261218) internal successors, (3804), 3030 states have internal predecessors, (3804), 404 states have call successors, (404), 320 states have call predecessors, (404), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2021-12-06 23:24:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 4761 transitions. [2021-12-06 23:24:51,251 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 4761 transitions. Word has length 80 [2021-12-06 23:24:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:51,252 INFO L470 AbstractCegarLoop]: Abstraction has 3785 states and 4761 transitions. [2021-12-06 23:24:51,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 4761 transitions. [2021-12-06 23:24:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:51,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:51,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:51,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 23:24:51,255 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1898309359, now seen corresponding path program 1 times [2021-12-06 23:24:51,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:51,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913296738] [2021-12-06 23:24:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:51,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:51,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:51,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:51,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913296738] [2021-12-06 23:24:51,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913296738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:51,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:51,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:51,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127947549] [2021-12-06 23:24:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:51,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:51,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:51,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:51,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:51,311 INFO L87 Difference]: Start difference. First operand 3785 states and 4761 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:51,849 INFO L93 Difference]: Finished difference Result 4358 states and 5649 transitions. [2021-12-06 23:24:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:24:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:51,859 INFO L225 Difference]: With dead ends: 4358 [2021-12-06 23:24:51,859 INFO L226 Difference]: Without dead ends: 3925 [2021-12-06 23:24:51,861 INFO L932 BasicCegarLoop]: 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 [2021-12-06 23:24:51,861 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 722 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:51,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [743 Valid, 817 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:24:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2021-12-06 23:24:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3785. [2021-12-06 23:24:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 2986 states have (on average 1.2729403884795714) internal successors, (3801), 3030 states have internal predecessors, (3801), 404 states have call successors, (404), 320 states have call predecessors, (404), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2021-12-06 23:24:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 4758 transitions. [2021-12-06 23:24:52,060 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 4758 transitions. Word has length 80 [2021-12-06 23:24:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:52,061 INFO L470 AbstractCegarLoop]: Abstraction has 3785 states and 4758 transitions. [2021-12-06 23:24:52,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 4758 transitions. [2021-12-06 23:24:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:52,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:52,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:52,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 23:24:52,064 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1952702257, now seen corresponding path program 1 times [2021-12-06 23:24:52,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:52,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60147363] [2021-12-06 23:24:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:52,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:52,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:52,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60147363] [2021-12-06 23:24:52,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60147363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:52,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:52,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:52,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270881832] [2021-12-06 23:24:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:52,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:52,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:52,125 INFO L87 Difference]: Start difference. First operand 3785 states and 4758 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:52,635 INFO L93 Difference]: Finished difference Result 4354 states and 5633 transitions. [2021-12-06 23:24:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:24:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:52,645 INFO L225 Difference]: With dead ends: 4354 [2021-12-06 23:24:52,645 INFO L226 Difference]: Without dead ends: 3921 [2021-12-06 23:24:52,647 INFO L932 BasicCegarLoop]: 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 [2021-12-06 23:24:52,648 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 610 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:52,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 954 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:24:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2021-12-06 23:24:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3785. [2021-12-06 23:24:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 2986 states have (on average 1.2719356999330207) internal successors, (3798), 3030 states have internal predecessors, (3798), 404 states have call successors, (404), 320 states have call predecessors, (404), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2021-12-06 23:24:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 4755 transitions. [2021-12-06 23:24:52,858 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 4755 transitions. Word has length 80 [2021-12-06 23:24:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:52,858 INFO L470 AbstractCegarLoop]: Abstraction has 3785 states and 4755 transitions. [2021-12-06 23:24:52,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 4755 transitions. [2021-12-06 23:24:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:52,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:52,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:52,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 23:24:52,861 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1924868433, now seen corresponding path program 1 times [2021-12-06 23:24:52,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:52,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363241348] [2021-12-06 23:24:52,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:52,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:52,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:52,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363241348] [2021-12-06 23:24:52,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363241348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:52,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:52,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:52,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011281276] [2021-12-06 23:24:52,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:52,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:52,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:52,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:52,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:52,920 INFO L87 Difference]: Start difference. First operand 3785 states and 4755 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:53,819 INFO L93 Difference]: Finished difference Result 4808 states and 6293 transitions. [2021-12-06 23:24:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:24:53,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:53,829 INFO L225 Difference]: With dead ends: 4808 [2021-12-06 23:24:53,829 INFO L226 Difference]: Without dead ends: 4375 [2021-12-06 23:24:53,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:24:53,832 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 757 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:53,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 1588 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 23:24:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2021-12-06 23:24:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 4060. [2021-12-06 23:24:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 3225 states have (on average 1.2883720930232558) internal successors, (4155), 3271 states have internal predecessors, (4155), 426 states have call successors, (426), 332 states have call predecessors, (426), 407 states have return successors, (583), 466 states have call predecessors, (583), 423 states have call successors, (583) [2021-12-06 23:24:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5164 transitions. [2021-12-06 23:24:54,037 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5164 transitions. Word has length 80 [2021-12-06 23:24:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:54,038 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 5164 transitions. [2021-12-06 23:24:54,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5164 transitions. [2021-12-06 23:24:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:54,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:54,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:54,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 23:24:54,040 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1690826609, now seen corresponding path program 1 times [2021-12-06 23:24:54,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:54,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394115502] [2021-12-06 23:24:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:54,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:54,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:54,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394115502] [2021-12-06 23:24:54,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394115502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:54,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:54,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:54,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139636080] [2021-12-06 23:24:54,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:54,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:54,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:54,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:54,094 INFO L87 Difference]: Start difference. First operand 4060 states and 5164 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:54,993 INFO L93 Difference]: Finished difference Result 5803 states and 7774 transitions. [2021-12-06 23:24:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:24:54,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:55,004 INFO L225 Difference]: With dead ends: 5803 [2021-12-06 23:24:55,004 INFO L226 Difference]: Without dead ends: 5095 [2021-12-06 23:24:55,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:24:55,008 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 858 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:55,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [882 Valid, 1190 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:24:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2021-12-06 23:24:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 4562. [2021-12-06 23:24:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4562 states, 3657 states have (on average 1.3089964451736396) internal successors, (4787), 3707 states have internal predecessors, (4787), 468 states have call successors, (468), 356 states have call predecessors, (468), 435 states have return successors, (647), 512 states have call predecessors, (647), 465 states have call successors, (647) [2021-12-06 23:24:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 5902 transitions. [2021-12-06 23:24:55,278 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 5902 transitions. Word has length 80 [2021-12-06 23:24:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:55,278 INFO L470 AbstractCegarLoop]: Abstraction has 4562 states and 5902 transitions. [2021-12-06 23:24:55,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 5902 transitions. [2021-12-06 23:24:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:55,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:55,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:55,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 23:24:55,281 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash 270748049, now seen corresponding path program 1 times [2021-12-06 23:24:55,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:55,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673475569] [2021-12-06 23:24:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:55,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:55,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673475569] [2021-12-06 23:24:55,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673475569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:55,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:55,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:55,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580311254] [2021-12-06 23:24:55,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:55,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:55,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:55,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:55,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:55,339 INFO L87 Difference]: Start difference. First operand 4562 states and 5902 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:56,310 INFO L93 Difference]: Finished difference Result 7475 states and 10240 transitions. [2021-12-06 23:24:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:24:56,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:56,325 INFO L225 Difference]: With dead ends: 7475 [2021-12-06 23:24:56,325 INFO L226 Difference]: Without dead ends: 6265 [2021-12-06 23:24:56,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:24:56,332 INFO L933 BasicCegarLoop]: 469 mSDtfsCounter, 736 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:56,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1519 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 23:24:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6265 states. [2021-12-06 23:24:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6265 to 5609. [2021-12-06 23:24:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 4568 states have (on average 1.3443520140105079) internal successors, (6141), 4626 states have internal predecessors, (6141), 548 states have call successors, (548), 404 states have call predecessors, (548), 491 states have return successors, (789), 600 states have call predecessors, (789), 545 states have call successors, (789) [2021-12-06 23:24:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 7478 transitions. [2021-12-06 23:24:56,623 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 7478 transitions. Word has length 80 [2021-12-06 23:24:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:56,624 INFO L470 AbstractCegarLoop]: Abstraction has 5609 states and 7478 transitions. [2021-12-06 23:24:56,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 7478 transitions. [2021-12-06 23:24:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:56,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:56,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:56,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 23:24:56,628 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash 831447827, now seen corresponding path program 1 times [2021-12-06 23:24:56,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:56,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206487968] [2021-12-06 23:24:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:56,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:56,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:56,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:56,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:56,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206487968] [2021-12-06 23:24:56,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206487968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:56,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:56,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:56,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554226713] [2021-12-06 23:24:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:56,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:56,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:56,690 INFO L87 Difference]: Start difference. First operand 5609 states and 7478 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:57,626 INFO L93 Difference]: Finished difference Result 9353 states and 13078 transitions. [2021-12-06 23:24:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:24:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:57,649 INFO L225 Difference]: With dead ends: 9353 [2021-12-06 23:24:57,649 INFO L226 Difference]: Without dead ends: 7097 [2021-12-06 23:24:57,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 23:24:57,658 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 460 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:57,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 1351 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:24:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2021-12-06 23:24:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 5660. [2021-12-06 23:24:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5660 states, 4619 states have (on average 1.3405499025763152) internal successors, (6192), 4677 states have internal predecessors, (6192), 548 states have call successors, (548), 404 states have call predecessors, (548), 491 states have return successors, (789), 600 states have call predecessors, (789), 545 states have call successors, (789) [2021-12-06 23:24:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5660 states to 5660 states and 7529 transitions. [2021-12-06 23:24:58,012 INFO L78 Accepts]: Start accepts. Automaton has 5660 states and 7529 transitions. Word has length 80 [2021-12-06 23:24:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:24:58,012 INFO L470 AbstractCegarLoop]: Abstraction has 5660 states and 7529 transitions. [2021-12-06 23:24:58,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5660 states and 7529 transitions. [2021-12-06 23:24:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-06 23:24:58,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:24:58,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:24:58,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 23:24:58,016 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:24:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:24:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 350367569, now seen corresponding path program 1 times [2021-12-06 23:24:58,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:24:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253442123] [2021-12-06 23:24:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:24:58,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:24:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:24:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:24:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:24:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:24:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:24:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:24:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:24:58,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:24:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253442123] [2021-12-06 23:24:58,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253442123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:24:58,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:24:58,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:24:58,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331455074] [2021-12-06 23:24:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:24:58,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:24:58,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:24:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:24:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:24:58,090 INFO L87 Difference]: Start difference. First operand 5660 states and 7529 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:24:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:24:59,614 INFO L93 Difference]: Finished difference Result 13600 states and 19634 transitions. [2021-12-06 23:24:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 23:24:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2021-12-06 23:24:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:24:59,640 INFO L225 Difference]: With dead ends: 13600 [2021-12-06 23:24:59,640 INFO L226 Difference]: Without dead ends: 11293 [2021-12-06 23:24:59,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-06 23:24:59,650 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1537 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-06 23:24:59,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1560 Valid, 1406 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-06 23:24:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11293 states. [2021-12-06 23:25:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11293 to 9930. [2021-12-06 23:25:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9930 states, 8294 states have (on average 1.388473595370147) internal successors, (11516), 8411 states have internal predecessors, (11516), 903 states have call successors, (903), 612 states have call predecessors, (903), 731 states have return successors, (1414), 928 states have call predecessors, (1414), 900 states have call successors, (1414) [2021-12-06 23:25:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9930 states to 9930 states and 13833 transitions. [2021-12-06 23:25:00,220 INFO L78 Accepts]: Start accepts. Automaton has 9930 states and 13833 transitions. Word has length 80 [2021-12-06 23:25:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:00,220 INFO L470 AbstractCegarLoop]: Abstraction has 9930 states and 13833 transitions. [2021-12-06 23:25:00,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 23:25:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 9930 states and 13833 transitions. [2021-12-06 23:25:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 23:25:00,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:00,225 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:00,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 23:25:00,225 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1956288145, now seen corresponding path program 1 times [2021-12-06 23:25:00,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:00,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835510829] [2021-12-06 23:25:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:00,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:25:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:25:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:25:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:25:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 23:25:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 23:25:00,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:00,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835510829] [2021-12-06 23:25:00,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835510829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:00,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:25:00,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:25:00,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593384273] [2021-12-06 23:25:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:00,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:25:00,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:25:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:00,298 INFO L87 Difference]: Start difference. First operand 9930 states and 13833 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:25:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:01,433 INFO L93 Difference]: Finished difference Result 16802 states and 22250 transitions. [2021-12-06 23:25:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 23:25:01,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2021-12-06 23:25:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:01,455 INFO L225 Difference]: With dead ends: 16802 [2021-12-06 23:25:01,456 INFO L226 Difference]: Without dead ends: 12165 [2021-12-06 23:25:01,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-06 23:25:01,465 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 887 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:01,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 1387 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:25:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2021-12-06 23:25:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 11845. [2021-12-06 23:25:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11845 states, 9752 states have (on average 1.3575676784249384) internal successors, (13239), 9912 states have internal predecessors, (13239), 1107 states have call successors, (1107), 786 states have call predecessors, (1107), 984 states have return successors, (1796), 1168 states have call predecessors, (1796), 1104 states have call successors, (1796) [2021-12-06 23:25:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11845 states to 11845 states and 16142 transitions. [2021-12-06 23:25:02,147 INFO L78 Accepts]: Start accepts. Automaton has 11845 states and 16142 transitions. Word has length 84 [2021-12-06 23:25:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:02,147 INFO L470 AbstractCegarLoop]: Abstraction has 11845 states and 16142 transitions. [2021-12-06 23:25:02,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:25:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 11845 states and 16142 transitions. [2021-12-06 23:25:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-06 23:25:02,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:02,152 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:02,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 23:25:02,153 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash -197625515, now seen corresponding path program 1 times [2021-12-06 23:25:02,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:02,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28155015] [2021-12-06 23:25:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:02,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:25:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:25:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:25:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:25:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 23:25:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 23:25:02,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:02,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28155015] [2021-12-06 23:25:02,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28155015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:02,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:25:02,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:25:02,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177717698] [2021-12-06 23:25:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:02,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:25:02,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:02,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:25:02,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:25:02,213 INFO L87 Difference]: Start difference. First operand 11845 states and 16142 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:25:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:03,419 INFO L93 Difference]: Finished difference Result 15848 states and 20982 transitions. [2021-12-06 23:25:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 23:25:03,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2021-12-06 23:25:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:03,441 INFO L225 Difference]: With dead ends: 15848 [2021-12-06 23:25:03,441 INFO L226 Difference]: Without dead ends: 11255 [2021-12-06 23:25:03,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-06 23:25:03,451 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 1278 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:03,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1315 Valid, 1402 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:25:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11255 states. [2021-12-06 23:25:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11255 to 10921. [2021-12-06 23:25:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10921 states, 9041 states have (on average 1.3646720495520408) internal successors, (12338), 9183 states have internal predecessors, (12338), 1008 states have call successors, (1008), 701 states have call predecessors, (1008), 870 states have return successors, (1574), 1058 states have call predecessors, (1574), 1005 states have call successors, (1574) [2021-12-06 23:25:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 14920 transitions. [2021-12-06 23:25:04,035 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 14920 transitions. Word has length 93 [2021-12-06 23:25:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:04,035 INFO L470 AbstractCegarLoop]: Abstraction has 10921 states and 14920 transitions. [2021-12-06 23:25:04,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:25:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 14920 transitions. [2021-12-06 23:25:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-06 23:25:04,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:04,046 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:04,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 23:25:04,046 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1663679213, now seen corresponding path program 1 times [2021-12-06 23:25:04,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:04,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401631846] [2021-12-06 23:25:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:04,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:25:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 23:25:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 23:25:04,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:04,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401631846] [2021-12-06 23:25:04,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401631846] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:04,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346891710] [2021-12-06 23:25:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:04,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:04,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:04,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:04,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 23:25:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:04,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:25:04,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 23:25:04,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:04,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346891710] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:04,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:04,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 23:25:04,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136971775] [2021-12-06 23:25:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:04,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:04,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:04,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:04,318 INFO L87 Difference]: Start difference. First operand 10921 states and 14920 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:25:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:05,153 INFO L93 Difference]: Finished difference Result 23880 states and 34366 transitions. [2021-12-06 23:25:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:05,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 129 [2021-12-06 23:25:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:05,186 INFO L225 Difference]: With dead ends: 23880 [2021-12-06 23:25:05,186 INFO L226 Difference]: Without dead ends: 17303 [2021-12-06 23:25:05,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:05,201 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 311 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:05,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 581 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17303 states. [2021-12-06 23:25:06,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17303 to 17195. [2021-12-06 23:25:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17195 states, 14453 states have (on average 1.3970801909638138) internal successors, (20192), 14670 states have internal predecessors, (20192), 1514 states have call successors, (1514), 1009 states have call predecessors, (1514), 1226 states have return successors, (2417), 1537 states have call predecessors, (2417), 1511 states have call successors, (2417) [2021-12-06 23:25:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17195 states to 17195 states and 24123 transitions. [2021-12-06 23:25:06,195 INFO L78 Accepts]: Start accepts. Automaton has 17195 states and 24123 transitions. Word has length 129 [2021-12-06 23:25:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:06,196 INFO L470 AbstractCegarLoop]: Abstraction has 17195 states and 24123 transitions. [2021-12-06 23:25:06,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 23:25:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 17195 states and 24123 transitions. [2021-12-06 23:25:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-06 23:25:06,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:06,211 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:06,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-06 23:25:06,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 23:25:06,413 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 389348365, now seen corresponding path program 1 times [2021-12-06 23:25:06,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:06,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079610922] [2021-12-06 23:25:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:06,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:25:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 23:25:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 23:25:06,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079610922] [2021-12-06 23:25:06,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079610922] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411633962] [2021-12-06 23:25:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:06,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:06,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:06,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 23:25:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:06,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:25:06,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:25:06,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:06,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411633962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:06,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:06,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:25:06,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353719824] [2021-12-06 23:25:06,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:06,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:06,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:06,674 INFO L87 Difference]: Start difference. First operand 17195 states and 24123 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:25:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:08,097 INFO L93 Difference]: Finished difference Result 42266 states and 61271 transitions. [2021-12-06 23:25:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:08,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 129 [2021-12-06 23:25:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:08,136 INFO L225 Difference]: With dead ends: 42266 [2021-12-06 23:25:08,136 INFO L226 Difference]: Without dead ends: 19454 [2021-12-06 23:25:08,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:08,168 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 192 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:08,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 918 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19454 states. [2021-12-06 23:25:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19454 to 19454. [2021-12-06 23:25:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19454 states, 16409 states have (on average 1.4016698153452374) internal successors, (23000), 16642 states have internal predecessors, (23000), 1693 states have call successors, (1693), 1117 states have call predecessors, (1693), 1350 states have return successors, (2723), 1716 states have call predecessors, (2723), 1690 states have call successors, (2723) [2021-12-06 23:25:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19454 states to 19454 states and 27416 transitions. [2021-12-06 23:25:09,277 INFO L78 Accepts]: Start accepts. Automaton has 19454 states and 27416 transitions. Word has length 129 [2021-12-06 23:25:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:09,277 INFO L470 AbstractCegarLoop]: Abstraction has 19454 states and 27416 transitions. [2021-12-06 23:25:09,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:25:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 19454 states and 27416 transitions. [2021-12-06 23:25:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-06 23:25:09,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:09,298 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:09,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 23:25:09,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:09,499 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1234059877, now seen corresponding path program 1 times [2021-12-06 23:25:09,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355783993] [2021-12-06 23:25:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:09,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:25:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:25:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:25:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:25:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 23:25:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 23:25:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:25:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 23:25:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 23:25:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 23:25:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-06 23:25:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 23:25:09,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:09,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355783993] [2021-12-06 23:25:09,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355783993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:09,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860676410] [2021-12-06 23:25:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:09,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:09,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:09,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 23:25:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:09,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 23:25:09,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 23:25:09,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:09,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860676410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:09,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:09,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-06 23:25:09,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191651637] [2021-12-06 23:25:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:09,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:25:09,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:25:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:25:09,777 INFO L87 Difference]: Start difference. First operand 19454 states and 27416 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 23:25:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:10,654 INFO L93 Difference]: Finished difference Result 21620 states and 30039 transitions. [2021-12-06 23:25:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:25:10,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2021-12-06 23:25:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:10,724 INFO L225 Difference]: With dead ends: 21620 [2021-12-06 23:25:10,724 INFO L226 Difference]: Without dead ends: 17315 [2021-12-06 23:25:10,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-06 23:25:10,730 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 34 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:10,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1783 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17315 states. [2021-12-06 23:25:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17315 to 17190. [2021-12-06 23:25:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17190 states, 14722 states have (on average 1.4227686455644613) internal successors, (20946), 14904 states have internal predecessors, (20946), 1417 states have call successors, (1417), 883 states have call predecessors, (1417), 1049 states have return successors, (2330), 1418 states have call predecessors, (2330), 1414 states have call successors, (2330) [2021-12-06 23:25:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17190 states to 17190 states and 24693 transitions. [2021-12-06 23:25:11,595 INFO L78 Accepts]: Start accepts. Automaton has 17190 states and 24693 transitions. Word has length 145 [2021-12-06 23:25:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:11,596 INFO L470 AbstractCegarLoop]: Abstraction has 17190 states and 24693 transitions. [2021-12-06 23:25:11,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 23:25:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17190 states and 24693 transitions. [2021-12-06 23:25:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-06 23:25:11,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:11,612 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:11,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 23:25:11,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:11,814 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1525119333, now seen corresponding path program 1 times [2021-12-06 23:25:11,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:11,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376648748] [2021-12-06 23:25:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:11,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:25:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:25:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:25:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:25:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 23:25:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 23:25:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-06 23:25:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 23:25:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 23:25:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-06 23:25:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 23:25:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 23:25:11,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376648748] [2021-12-06 23:25:11,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376648748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:11,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:25:11,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:25:11,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146715359] [2021-12-06 23:25:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:11,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:25:11,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:25:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:25:11,874 INFO L87 Difference]: Start difference. First operand 17190 states and 24693 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 23:25:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:12,810 INFO L93 Difference]: Finished difference Result 17255 states and 24761 transitions. [2021-12-06 23:25:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:25:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2021-12-06 23:25:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:12,846 INFO L225 Difference]: With dead ends: 17255 [2021-12-06 23:25:12,846 INFO L226 Difference]: Without dead ends: 16812 [2021-12-06 23:25:12,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:25:12,854 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 522 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:12,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 804 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:25:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16812 states. [2021-12-06 23:25:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16812 to 16750. [2021-12-06 23:25:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16750 states, 14378 states have (on average 1.4287105299763527) internal successors, (20542), 14557 states have internal predecessors, (20542), 1371 states have call successors, (1371), 843 states have call predecessors, (1371), 999 states have return successors, (2266), 1365 states have call predecessors, (2266), 1368 states have call successors, (2266) [2021-12-06 23:25:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16750 states to 16750 states and 24179 transitions. [2021-12-06 23:25:13,731 INFO L78 Accepts]: Start accepts. Automaton has 16750 states and 24179 transitions. Word has length 147 [2021-12-06 23:25:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:13,732 INFO L470 AbstractCegarLoop]: Abstraction has 16750 states and 24179 transitions. [2021-12-06 23:25:13,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 23:25:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16750 states and 24179 transitions. [2021-12-06 23:25:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 23:25:13,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:13,745 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:13,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 23:25:13,746 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1268854173, now seen corresponding path program 1 times [2021-12-06 23:25:13,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561992963] [2021-12-06 23:25:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:13,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:25:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:25:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:25:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:25:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 23:25:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:25:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-06 23:25:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 23:25:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 23:25:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-06 23:25:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 23:25:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 23:25:13,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561992963] [2021-12-06 23:25:13,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561992963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:13,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:25:13,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:25:13,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150045858] [2021-12-06 23:25:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:13,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:25:13,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:13,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:25:13,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:25:13,808 INFO L87 Difference]: Start difference. First operand 16750 states and 24179 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 23:25:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:14,929 INFO L93 Difference]: Finished difference Result 18227 states and 25978 transitions. [2021-12-06 23:25:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:25:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2021-12-06 23:25:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:14,967 INFO L225 Difference]: With dead ends: 18227 [2021-12-06 23:25:14,967 INFO L226 Difference]: Without dead ends: 16851 [2021-12-06 23:25:14,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:25:14,976 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 453 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:14,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 1145 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:25:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16851 states. [2021-12-06 23:25:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16851 to 16659. [2021-12-06 23:25:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16659 states, 14309 states have (on average 1.4296596547627367) internal successors, (20457), 14489 states have internal predecessors, (20457), 1362 states have call successors, (1362), 838 states have call predecessors, (1362), 986 states have return successors, (2250), 1347 states have call predecessors, (2250), 1359 states have call successors, (2250) [2021-12-06 23:25:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16659 states to 16659 states and 24069 transitions. [2021-12-06 23:25:15,845 INFO L78 Accepts]: Start accepts. Automaton has 16659 states and 24069 transitions. Word has length 159 [2021-12-06 23:25:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:15,845 INFO L470 AbstractCegarLoop]: Abstraction has 16659 states and 24069 transitions. [2021-12-06 23:25:15,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 23:25:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 16659 states and 24069 transitions. [2021-12-06 23:25:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-06 23:25:15,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:15,859 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:15,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 23:25:15,860 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 35384604, now seen corresponding path program 1 times [2021-12-06 23:25:15,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:15,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675786070] [2021-12-06 23:25:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:15,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:25:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:25:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:25:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:25:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 23:25:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:25:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 23:25:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 23:25:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 23:25:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 23:25:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-06 23:25:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-06 23:25:15,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:15,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675786070] [2021-12-06 23:25:15,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675786070] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:15,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700709095] [2021-12-06 23:25:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:15,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:15,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:15,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:15,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 23:25:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:16,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 23:25:16,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 23:25:16,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:25:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-12-06 23:25:16,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700709095] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:25:16,350 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:25:16,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-06 23:25:16,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302957098] [2021-12-06 23:25:16,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:25:16,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 23:25:16,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:16,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 23:25:16,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-06 23:25:16,352 INFO L87 Difference]: Start difference. First operand 16659 states and 24069 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-06 23:25:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:17,685 INFO L93 Difference]: Finished difference Result 18631 states and 26522 transitions. [2021-12-06 23:25:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 23:25:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2021-12-06 23:25:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:17,719 INFO L225 Difference]: With dead ends: 18631 [2021-12-06 23:25:17,719 INFO L226 Difference]: Without dead ends: 17199 [2021-12-06 23:25:17,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2021-12-06 23:25:17,728 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 1416 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:17,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1440 Valid, 1131 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 23:25:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17199 states. [2021-12-06 23:25:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17199 to 17049. [2021-12-06 23:25:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17049 states, 14587 states have (on average 1.4231850277644478) internal successors, (20760), 14775 states have internal predecessors, (20760), 1416 states have call successors, (1416), 888 states have call predecessors, (1416), 1044 states have return successors, (2364), 1401 states have call predecessors, (2364), 1413 states have call successors, (2364) [2021-12-06 23:25:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17049 states to 17049 states and 24540 transitions. [2021-12-06 23:25:18,615 INFO L78 Accepts]: Start accepts. Automaton has 17049 states and 24540 transitions. Word has length 162 [2021-12-06 23:25:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:18,615 INFO L470 AbstractCegarLoop]: Abstraction has 17049 states and 24540 transitions. [2021-12-06 23:25:18,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-06 23:25:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17049 states and 24540 transitions. [2021-12-06 23:25:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-12-06 23:25:18,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:18,631 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:18,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 23:25:18,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 23:25:18,833 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1043385329, now seen corresponding path program 1 times [2021-12-06 23:25:18,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:18,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679225872] [2021-12-06 23:25:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:18,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:25:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 23:25:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-06 23:25:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-06 23:25:18,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679225872] [2021-12-06 23:25:18,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679225872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529210026] [2021-12-06 23:25:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:18,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:18,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:18,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 23:25:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:19,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:25:19,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:25:19,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:19,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529210026] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:19,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:19,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 23:25:19,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104352126] [2021-12-06 23:25:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:19,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:19,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:19,163 INFO L87 Difference]: Start difference. First operand 17049 states and 24540 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 23:25:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:20,594 INFO L93 Difference]: Finished difference Result 46808 states and 68967 transitions. [2021-12-06 23:25:20,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:20,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 167 [2021-12-06 23:25:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:20,665 INFO L225 Difference]: With dead ends: 46808 [2021-12-06 23:25:20,665 INFO L226 Difference]: Without dead ends: 31698 [2021-12-06 23:25:20,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:20,697 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 264 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:20,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 579 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31698 states. [2021-12-06 23:25:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31698 to 31450. [2021-12-06 23:25:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31450 states, 27007 states have (on average 1.4332210167734292) internal successors, (38707), 27361 states have internal predecessors, (38707), 2565 states have call successors, (2565), 1608 states have call predecessors, (2565), 1876 states have return successors, (4289), 2496 states have call predecessors, (4289), 2562 states have call successors, (4289) [2021-12-06 23:25:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31450 states to 31450 states and 45561 transitions. [2021-12-06 23:25:22,346 INFO L78 Accepts]: Start accepts. Automaton has 31450 states and 45561 transitions. Word has length 167 [2021-12-06 23:25:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:22,346 INFO L470 AbstractCegarLoop]: Abstraction has 31450 states and 45561 transitions. [2021-12-06 23:25:22,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 23:25:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 31450 states and 45561 transitions. [2021-12-06 23:25:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-12-06 23:25:22,378 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:22,378 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:22,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 23:25:22,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:22,579 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash -932684503, now seen corresponding path program 1 times [2021-12-06 23:25:22,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:22,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272009468] [2021-12-06 23:25:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:22,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:25:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 23:25:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-06 23:25:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-06 23:25:22,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:22,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272009468] [2021-12-06 23:25:22,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272009468] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:22,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677202367] [2021-12-06 23:25:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:22,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:22,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:22,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 23:25:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:22,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:25:22,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:25:22,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:22,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677202367] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:22,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:22,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 23:25:22,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242046227] [2021-12-06 23:25:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:22,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:22,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:22,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:22,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:22,891 INFO L87 Difference]: Start difference. First operand 31450 states and 45561 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 23:25:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:25,103 INFO L93 Difference]: Finished difference Result 62765 states and 92201 transitions. [2021-12-06 23:25:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 167 [2021-12-06 23:25:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:25,204 INFO L225 Difference]: With dead ends: 62765 [2021-12-06 23:25:25,204 INFO L226 Difference]: Without dead ends: 44745 [2021-12-06 23:25:25,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:25,245 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 265 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:25,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 600 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44745 states. [2021-12-06 23:25:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44745 to 44389. [2021-12-06 23:25:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44389 states, 38232 states have (on average 1.4394224733207783) internal successors, (55032), 38718 states have internal predecessors, (55032), 3554 states have call successors, (3554), 2237 states have call predecessors, (3554), 2601 states have return successors, (5823), 3449 states have call predecessors, (5823), 3551 states have call successors, (5823) [2021-12-06 23:25:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44389 states to 44389 states and 64409 transitions. [2021-12-06 23:25:27,650 INFO L78 Accepts]: Start accepts. Automaton has 44389 states and 64409 transitions. Word has length 167 [2021-12-06 23:25:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:27,651 INFO L470 AbstractCegarLoop]: Abstraction has 44389 states and 64409 transitions. [2021-12-06 23:25:27,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 23:25:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44389 states and 64409 transitions. [2021-12-06 23:25:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-12-06 23:25:27,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:27,750 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:27,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 23:25:27,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:27,952 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash 99767870, now seen corresponding path program 1 times [2021-12-06 23:25:27,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:27,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299185782] [2021-12-06 23:25:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:27,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:27,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 23:25:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 23:25:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 23:25:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 23:25:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 23:25:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 23:25:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 23:25:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 23:25:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-06 23:25:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 23:25:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-06 23:25:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-06 23:25:28,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299185782] [2021-12-06 23:25:28,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299185782] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614403907] [2021-12-06 23:25:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:28,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:28,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:28,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:28,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 23:25:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:28,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:25:28,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 23:25:28,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:28,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614403907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:28,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:28,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:25:28,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897309596] [2021-12-06 23:25:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:28,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:28,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:28,261 INFO L87 Difference]: Start difference. First operand 44389 states and 64409 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 23:25:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:30,241 INFO L93 Difference]: Finished difference Result 46151 states and 66538 transitions. [2021-12-06 23:25:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 179 [2021-12-06 23:25:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:30,336 INFO L225 Difference]: With dead ends: 46151 [2021-12-06 23:25:30,336 INFO L226 Difference]: Without dead ends: 44396 [2021-12-06 23:25:30,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:30,353 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 33 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:30,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 738 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44396 states. [2021-12-06 23:25:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44396 to 44389. [2021-12-06 23:25:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44389 states, 38232 states have (on average 1.439265536723164) internal successors, (55026), 38718 states have internal predecessors, (55026), 3554 states have call successors, (3554), 2237 states have call predecessors, (3554), 2601 states have return successors, (5823), 3449 states have call predecessors, (5823), 3551 states have call successors, (5823) [2021-12-06 23:25:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44389 states to 44389 states and 64403 transitions. [2021-12-06 23:25:32,872 INFO L78 Accepts]: Start accepts. Automaton has 44389 states and 64403 transitions. Word has length 179 [2021-12-06 23:25:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:32,872 INFO L470 AbstractCegarLoop]: Abstraction has 44389 states and 64403 transitions. [2021-12-06 23:25:32,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 23:25:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 44389 states and 64403 transitions. [2021-12-06 23:25:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-12-06 23:25:32,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:32,908 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:32,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 23:25:33,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-06 23:25:33,111 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1939442957, now seen corresponding path program 1 times [2021-12-06 23:25:33,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577086501] [2021-12-06 23:25:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:33,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 23:25:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 23:25:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 23:25:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 23:25:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 23:25:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 23:25:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 23:25:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 23:25:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:25:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:25:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-06 23:25:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 23:25:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-06 23:25:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-06 23:25:33,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:33,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577086501] [2021-12-06 23:25:33,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577086501] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:33,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88599255] [2021-12-06 23:25:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:33,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:33,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:33,167 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:33,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 23:25:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:33,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 23:25:33,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-12-06 23:25:33,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:33,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88599255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:33,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:33,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 23:25:33,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633340410] [2021-12-06 23:25:33,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:33,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:25:33,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:25:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:25:33,366 INFO L87 Difference]: Start difference. First operand 44389 states and 64403 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 23:25:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:35,543 INFO L93 Difference]: Finished difference Result 46216 states and 66600 transitions. [2021-12-06 23:25:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:25:35,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2021-12-06 23:25:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:35,646 INFO L225 Difference]: With dead ends: 46216 [2021-12-06 23:25:35,646 INFO L226 Difference]: Without dead ends: 44101 [2021-12-06 23:25:35,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:25:35,669 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 457 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:35,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 727 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:25:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44101 states. [2021-12-06 23:25:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44101 to 44059. [2021-12-06 23:25:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44059 states, 37979 states have (on average 1.4406909081334422) internal successors, (54716), 38458 states have internal predecessors, (54716), 3519 states have call successors, (3519), 2206 states have call predecessors, (3519), 2559 states have return successors, (5749), 3410 states have call predecessors, (5749), 3516 states have call successors, (5749) [2021-12-06 23:25:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44059 states to 44059 states and 63984 transitions. [2021-12-06 23:25:38,086 INFO L78 Accepts]: Start accepts. Automaton has 44059 states and 63984 transitions. Word has length 179 [2021-12-06 23:25:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:38,086 INFO L470 AbstractCegarLoop]: Abstraction has 44059 states and 63984 transitions. [2021-12-06 23:25:38,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 23:25:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 44059 states and 63984 transitions. [2021-12-06 23:25:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-06 23:25:38,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:38,123 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:38,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-06 23:25:38,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:38,324 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:38,325 INFO L85 PathProgramCache]: Analyzing trace with hash -665339890, now seen corresponding path program 1 times [2021-12-06 23:25:38,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:38,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634660363] [2021-12-06 23:25:38,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:38,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 23:25:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 23:25:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-06 23:25:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 23:25:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-12-06 23:25:38,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634660363] [2021-12-06 23:25:38,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634660363] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86711440] [2021-12-06 23:25:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:38,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:38,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:38,410 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:38,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 23:25:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:38,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:25:38,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 23:25:38,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:38,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86711440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:38,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:38,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:25:38,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173292908] [2021-12-06 23:25:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:38,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:38,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:38,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:38,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:38,616 INFO L87 Difference]: Start difference. First operand 44059 states and 63984 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 23:25:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:40,339 INFO L93 Difference]: Finished difference Result 66798 states and 97060 transitions. [2021-12-06 23:25:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 185 [2021-12-06 23:25:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:40,403 INFO L225 Difference]: With dead ends: 66798 [2021-12-06 23:25:40,403 INFO L226 Difference]: Without dead ends: 29697 [2021-12-06 23:25:40,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:40,454 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 286 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:40,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 401 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29697 states. [2021-12-06 23:25:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29697 to 27571. [2021-12-06 23:25:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27571 states, 23817 states have (on average 1.3811983037326279) internal successors, (32896), 24044 states have internal predecessors, (32896), 2121 states have call successors, (2121), 1442 states have call predecessors, (2121), 1631 states have return successors, (2950), 2092 states have call predecessors, (2950), 2118 states have call successors, (2950) [2021-12-06 23:25:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27571 states to 27571 states and 37967 transitions. [2021-12-06 23:25:42,240 INFO L78 Accepts]: Start accepts. Automaton has 27571 states and 37967 transitions. Word has length 185 [2021-12-06 23:25:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:42,241 INFO L470 AbstractCegarLoop]: Abstraction has 27571 states and 37967 transitions. [2021-12-06 23:25:42,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 23:25:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 27571 states and 37967 transitions. [2021-12-06 23:25:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-06 23:25:42,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:42,268 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:42,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 23:25:42,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:42,470 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2064215632, now seen corresponding path program 1 times [2021-12-06 23:25:42,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:42,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831222779] [2021-12-06 23:25:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:42,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 23:25:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 23:25:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 23:25:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 23:25:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 23:25:42,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:42,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831222779] [2021-12-06 23:25:42,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831222779] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:42,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801053910] [2021-12-06 23:25:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:42,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:42,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:42,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:42,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 23:25:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:42,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:25:42,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 23:25:42,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:42,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801053910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:42,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:42,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:25:42,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43306460] [2021-12-06 23:25:42,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:42,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:42,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:42,781 INFO L87 Difference]: Start difference. First operand 27571 states and 37967 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 23:25:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:44,398 INFO L93 Difference]: Finished difference Result 48631 states and 67961 transitions. [2021-12-06 23:25:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:44,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 185 [2021-12-06 23:25:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:44,454 INFO L225 Difference]: With dead ends: 48631 [2021-12-06 23:25:44,454 INFO L226 Difference]: Without dead ends: 25330 [2021-12-06 23:25:44,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:44,493 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 302 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:44,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 396 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25330 states. [2021-12-06 23:25:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25330 to 19642. [2021-12-06 23:25:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19642 states, 16991 states have (on average 1.334353481254782) internal successors, (22672), 17118 states have internal predecessors, (22672), 1476 states have call successors, (1476), 1064 states have call predecessors, (1476), 1173 states have return successors, (1923), 1463 states have call predecessors, (1923), 1473 states have call successors, (1923) [2021-12-06 23:25:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19642 states to 19642 states and 26071 transitions. [2021-12-06 23:25:45,912 INFO L78 Accepts]: Start accepts. Automaton has 19642 states and 26071 transitions. Word has length 185 [2021-12-06 23:25:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:45,913 INFO L470 AbstractCegarLoop]: Abstraction has 19642 states and 26071 transitions. [2021-12-06 23:25:45,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 23:25:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19642 states and 26071 transitions. [2021-12-06 23:25:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-06 23:25:45,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:45,929 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:45,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 23:25:46,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:46,130 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1794271634, now seen corresponding path program 1 times [2021-12-06 23:25:46,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:46,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990664796] [2021-12-06 23:25:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:46,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 23:25:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 23:25:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 23:25:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 23:25:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 23:25:46,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:46,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990664796] [2021-12-06 23:25:46,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990664796] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:46,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387907433] [2021-12-06 23:25:46,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:46,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:46,208 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:46,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 23:25:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:46,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:25:46,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-06 23:25:46,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:46,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387907433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:46,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:46,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:25:46,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075130756] [2021-12-06 23:25:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:46,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:46,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:46,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:46,386 INFO L87 Difference]: Start difference. First operand 19642 states and 26071 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 23:25:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:47,835 INFO L93 Difference]: Finished difference Result 39332 states and 52219 transitions. [2021-12-06 23:25:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:47,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 185 [2021-12-06 23:25:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:47,873 INFO L225 Difference]: With dead ends: 39332 [2021-12-06 23:25:47,873 INFO L226 Difference]: Without dead ends: 21300 [2021-12-06 23:25:47,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:47,897 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 316 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:47,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 583 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21300 states. [2021-12-06 23:25:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21300 to 20910. [2021-12-06 23:25:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20910 states, 18178 states have (on average 1.3047640004400924) internal successors, (23718), 18294 states have internal predecessors, (23718), 1480 states have call successors, (1480), 1134 states have call predecessors, (1480), 1250 states have return successors, (1913), 1485 states have call predecessors, (1913), 1477 states have call successors, (1913) [2021-12-06 23:25:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20910 states to 20910 states and 27111 transitions. [2021-12-06 23:25:49,412 INFO L78 Accepts]: Start accepts. Automaton has 20910 states and 27111 transitions. Word has length 185 [2021-12-06 23:25:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:49,413 INFO L470 AbstractCegarLoop]: Abstraction has 20910 states and 27111 transitions. [2021-12-06 23:25:49,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 23:25:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 20910 states and 27111 transitions. [2021-12-06 23:25:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-06 23:25:49,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:49,423 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:49,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-06 23:25:49,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-06 23:25:49,625 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash 119617118, now seen corresponding path program 1 times [2021-12-06 23:25:49,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:49,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564444072] [2021-12-06 23:25:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:49,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 23:25:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 23:25:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 23:25:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 23:25:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-12-06 23:25:49,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:49,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564444072] [2021-12-06 23:25:49,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564444072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:25:49,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478531243] [2021-12-06 23:25:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:49,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:25:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:25:49,725 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:25:49,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 23:25:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:49,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:25:49,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:25:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-06 23:25:49,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:25:49,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478531243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:49,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:25:49,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:25:49,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596398290] [2021-12-06 23:25:49,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:49,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:25:49,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:25:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:49,909 INFO L87 Difference]: Start difference. First operand 20910 states and 27111 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 23:25:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:52,533 INFO L93 Difference]: Finished difference Result 58912 states and 77445 transitions. [2021-12-06 23:25:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:25:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 186 [2021-12-06 23:25:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:52,613 INFO L225 Difference]: With dead ends: 58912 [2021-12-06 23:25:52,613 INFO L226 Difference]: Without dead ends: 39612 [2021-12-06 23:25:52,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:25:52,644 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 308 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:52,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 623 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:25:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39612 states. [2021-12-06 23:25:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39612 to 39329. [2021-12-06 23:25:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39329 states, 34354 states have (on average 1.302031786691506) internal successors, (44730), 34572 states have internal predecessors, (44730), 2697 states have call successors, (2697), 2084 states have call predecessors, (2697), 2276 states have return successors, (4281), 2680 states have call predecessors, (4281), 2694 states have call successors, (4281) [2021-12-06 23:25:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39329 states to 39329 states and 51708 transitions. [2021-12-06 23:25:55,560 INFO L78 Accepts]: Start accepts. Automaton has 39329 states and 51708 transitions. Word has length 186 [2021-12-06 23:25:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:25:55,560 INFO L470 AbstractCegarLoop]: Abstraction has 39329 states and 51708 transitions. [2021-12-06 23:25:55,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 23:25:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 39329 states and 51708 transitions. [2021-12-06 23:25:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-06 23:25:55,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:25:55,586 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:25:55,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-06 23:25:55,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-06 23:25:55,787 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:25:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:25:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1281738148, now seen corresponding path program 1 times [2021-12-06 23:25:55,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:25:55,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183310011] [2021-12-06 23:25:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:25:55,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:25:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:25:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:25:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:25:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:25:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:25:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 23:25:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 23:25:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 23:25:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:25:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 23:25:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:25:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-12-06 23:25:55,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:25:55,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183310011] [2021-12-06 23:25:55,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183310011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:25:55,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:25:55,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:25:55,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330928804] [2021-12-06 23:25:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:25:55,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:25:55,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:25:55,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:25:55,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:25:55,880 INFO L87 Difference]: Start difference. First operand 39329 states and 51708 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:25:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:25:59,038 INFO L93 Difference]: Finished difference Result 76355 states and 100376 transitions. [2021-12-06 23:25:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:25:59,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 186 [2021-12-06 23:25:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:25:59,113 INFO L225 Difference]: With dead ends: 76355 [2021-12-06 23:25:59,113 INFO L226 Difference]: Without dead ends: 38635 [2021-12-06 23:25:59,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:25:59,158 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 493 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:25:59,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 707 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:25:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38635 states. [2021-12-06 23:26:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38635 to 32888. [2021-12-06 23:26:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32888 states, 28782 states have (on average 1.301056215690362) internal successors, (37447), 29107 states have internal predecessors, (37447), 2084 states have call successors, (2084), 1606 states have call predecessors, (2084), 2020 states have return successors, (3552), 2178 states have call predecessors, (3552), 2081 states have call successors, (3552) [2021-12-06 23:26:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32888 states to 32888 states and 43083 transitions. [2021-12-06 23:26:01,824 INFO L78 Accepts]: Start accepts. Automaton has 32888 states and 43083 transitions. Word has length 186 [2021-12-06 23:26:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:26:01,824 INFO L470 AbstractCegarLoop]: Abstraction has 32888 states and 43083 transitions. [2021-12-06 23:26:01,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:26:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32888 states and 43083 transitions. [2021-12-06 23:26:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-12-06 23:26:01,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:26:01,845 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:26:01,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-06 23:26:01,845 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:26:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:26:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1988840800, now seen corresponding path program 1 times [2021-12-06 23:26:01,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:26:01,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090727905] [2021-12-06 23:26:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:01,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:26:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:26:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:26:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:26:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:26:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:26:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 23:26:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 23:26:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-06 23:26:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-06 23:26:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-06 23:26:01,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:26:01,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090727905] [2021-12-06 23:26:01,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090727905] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:26:01,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337923510] [2021-12-06 23:26:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:01,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:26:01,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:26:01,917 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:26:01,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 23:26:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:01,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:26:01,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:26:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-06 23:26:02,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:26:02,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337923510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:26:02,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:26:02,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:26:02,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608171122] [2021-12-06 23:26:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:26:02,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:26:02,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:26:02,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:26:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:26:02,099 INFO L87 Difference]: Start difference. First operand 32888 states and 43083 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 23:26:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:26:06,500 INFO L93 Difference]: Finished difference Result 92412 states and 122748 transitions. [2021-12-06 23:26:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:26:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 188 [2021-12-06 23:26:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:26:06,637 INFO L225 Difference]: With dead ends: 92412 [2021-12-06 23:26:06,637 INFO L226 Difference]: Without dead ends: 61134 [2021-12-06 23:26:06,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:26:06,688 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 313 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:26:06,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 615 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:26:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61134 states. [2021-12-06 23:26:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61134 to 59984. [2021-12-06 23:26:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59984 states, 52487 states have (on average 1.2987787452131003) internal successors, (68169), 53095 states have internal predecessors, (68169), 3843 states have call successors, (3843), 2913 states have call predecessors, (3843), 3652 states have return successors, (7858), 3983 states have call predecessors, (7858), 3840 states have call successors, (7858) [2021-12-06 23:26:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59984 states to 59984 states and 79870 transitions. [2021-12-06 23:26:11,454 INFO L78 Accepts]: Start accepts. Automaton has 59984 states and 79870 transitions. Word has length 188 [2021-12-06 23:26:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:26:11,454 INFO L470 AbstractCegarLoop]: Abstraction has 59984 states and 79870 transitions. [2021-12-06 23:26:11,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 23:26:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59984 states and 79870 transitions. [2021-12-06 23:26:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-12-06 23:26:11,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:26:11,498 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:26:11,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-06 23:26:11,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-06 23:26:11,700 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:26:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:26:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1950389858, now seen corresponding path program 1 times [2021-12-06 23:26:11,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:26:11,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123179334] [2021-12-06 23:26:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:11,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:26:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:26:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:26:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:26:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:26:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:26:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 23:26:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 23:26:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-06 23:26:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-06 23:26:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-12-06 23:26:11,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:26:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123179334] [2021-12-06 23:26:11,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123179334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:26:11,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:26:11,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:26:11,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127333644] [2021-12-06 23:26:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:26:11,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:26:11,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:26:11,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:26:11,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:26:11,758 INFO L87 Difference]: Start difference. First operand 59984 states and 79870 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:26:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:26:16,280 INFO L93 Difference]: Finished difference Result 111578 states and 148346 transitions. [2021-12-06 23:26:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:26:16,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 188 [2021-12-06 23:26:16,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:26:16,386 INFO L225 Difference]: With dead ends: 111578 [2021-12-06 23:26:16,386 INFO L226 Difference]: Without dead ends: 53203 [2021-12-06 23:26:16,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:26:16,453 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 491 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 23:26:16,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 705 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 23:26:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53203 states. [2021-12-06 23:26:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53203 to 46935. [2021-12-06 23:26:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46935 states, 41082 states have (on average 1.3014458887103841) internal successors, (53466), 41643 states have internal predecessors, (53466), 2898 states have call successors, (2898), 2209 states have call predecessors, (2898), 2953 states have return successors, (5796), 3086 states have call predecessors, (5796), 2895 states have call successors, (5796) [2021-12-06 23:26:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46935 states to 46935 states and 62160 transitions. [2021-12-06 23:26:20,619 INFO L78 Accepts]: Start accepts. Automaton has 46935 states and 62160 transitions. Word has length 188 [2021-12-06 23:26:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:26:20,619 INFO L470 AbstractCegarLoop]: Abstraction has 46935 states and 62160 transitions. [2021-12-06 23:26:20,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 23:26:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 46935 states and 62160 transitions. [2021-12-06 23:26:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-06 23:26:20,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:26:20,650 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:26:20,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-06 23:26:20,650 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:26:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:26:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1595262810, now seen corresponding path program 1 times [2021-12-06 23:26:20,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:26:20,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004595496] [2021-12-06 23:26:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:20,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:26:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:26:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:26:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:26:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:26:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:26:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:26:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:26:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-06 23:26:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-06 23:26:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-06 23:26:20,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:26:20,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004595496] [2021-12-06 23:26:20,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004595496] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:26:20,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673330114] [2021-12-06 23:26:20,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:20,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:26:20,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:26:20,715 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:26:20,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 23:26:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:20,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:26:20,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:26:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 23:26:20,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:26:20,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673330114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:26:20,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:26:20,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:26:20,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590584889] [2021-12-06 23:26:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:26:20,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:26:20,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:26:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:26:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:26:20,909 INFO L87 Difference]: Start difference. First operand 46935 states and 62160 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 23:26:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:26:24,561 INFO L93 Difference]: Finished difference Result 79635 states and 108805 transitions. [2021-12-06 23:26:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:26:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 190 [2021-12-06 23:26:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:26:24,655 INFO L225 Difference]: With dead ends: 79635 [2021-12-06 23:26:24,655 INFO L226 Difference]: Without dead ends: 47031 [2021-12-06 23:26:24,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:26:24,706 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 169 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:26:24,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 852 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:26:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47031 states. [2021-12-06 23:26:28,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47031 to 46863. [2021-12-06 23:26:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46863 states, 41010 states have (on average 1.2766398439405022) internal successors, (52355), 41571 states have internal predecessors, (52355), 2898 states have call successors, (2898), 2209 states have call predecessors, (2898), 2953 states have return successors, (5796), 3086 states have call predecessors, (5796), 2895 states have call successors, (5796) [2021-12-06 23:26:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46863 states to 46863 states and 61049 transitions. [2021-12-06 23:26:28,525 INFO L78 Accepts]: Start accepts. Automaton has 46863 states and 61049 transitions. Word has length 190 [2021-12-06 23:26:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:26:28,525 INFO L470 AbstractCegarLoop]: Abstraction has 46863 states and 61049 transitions. [2021-12-06 23:26:28,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 23:26:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 46863 states and 61049 transitions. [2021-12-06 23:26:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-12-06 23:26:28,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:26:28,556 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:26:28,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 23:26:28,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-12-06 23:26:28,757 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:26:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:26:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1347129113, now seen corresponding path program 1 times [2021-12-06 23:26:28,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:26:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708150956] [2021-12-06 23:26:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:28,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:26:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:26:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:26:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:26:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:26:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:26:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:26:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 23:26:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-06 23:26:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-06 23:26:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-12-06 23:26:28,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:26:28,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708150956] [2021-12-06 23:26:28,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708150956] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:26:28,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615478377] [2021-12-06 23:26:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:28,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:26:28,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:26:28,839 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:26:28,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 23:26:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:28,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:26:28,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:26:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 23:26:29,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:26:29,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615478377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:26:29,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:26:29,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:26:29,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611911010] [2021-12-06 23:26:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:26:29,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:26:29,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:26:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:26:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:26:29,042 INFO L87 Difference]: Start difference. First operand 46863 states and 61049 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 23:26:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:26:35,502 INFO L93 Difference]: Finished difference Result 129512 states and 171198 transitions. [2021-12-06 23:26:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:26:35,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 191 [2021-12-06 23:26:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:26:35,684 INFO L225 Difference]: With dead ends: 129512 [2021-12-06 23:26:35,684 INFO L226 Difference]: Without dead ends: 84259 [2021-12-06 23:26:35,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:26:35,746 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 183 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:26:35,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 891 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:26:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84259 states. [2021-12-06 23:26:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84259 to 84255. [2021-12-06 23:26:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84255 states, 73600 states have (on average 1.280203804347826) internal successors, (94223), 74620 states have internal predecessors, (94223), 5363 states have call successors, (5363), 4011 states have call predecessors, (5363), 5290 states have return successors, (12169), 5631 states have call predecessors, (12169), 5360 states have call successors, (12169) [2021-12-06 23:26:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84255 states to 84255 states and 111755 transitions. [2021-12-06 23:26:42,850 INFO L78 Accepts]: Start accepts. Automaton has 84255 states and 111755 transitions. Word has length 191 [2021-12-06 23:26:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:26:42,850 INFO L470 AbstractCegarLoop]: Abstraction has 84255 states and 111755 transitions. [2021-12-06 23:26:42,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 23:26:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 84255 states and 111755 transitions. [2021-12-06 23:26:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 23:26:42,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:26:42,902 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:26:42,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-06 23:26:43,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:26:43,102 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:26:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:26:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash 435877618, now seen corresponding path program 1 times [2021-12-06 23:26:43,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:26:43,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079586664] [2021-12-06 23:26:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:43,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:26:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:26:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:26:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:26:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:26:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:26:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:26:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:26:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 23:26:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-06 23:26:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-06 23:26:43,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:26:43,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079586664] [2021-12-06 23:26:43,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079586664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:26:43,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457433269] [2021-12-06 23:26:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:43,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:26:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:26:43,185 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:26:43,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 23:26:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:43,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 23:26:43,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:26:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-06 23:26:43,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:26:43,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457433269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:26:43,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:26:43,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 23:26:43,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81410190] [2021-12-06 23:26:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:26:43,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:26:43,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:26:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:26:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:26:43,399 INFO L87 Difference]: Start difference. First operand 84255 states and 111755 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:26:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:26:50,417 INFO L93 Difference]: Finished difference Result 166896 states and 222584 transitions. [2021-12-06 23:26:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 23:26:50,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-06 23:26:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:26:50,683 INFO L225 Difference]: With dead ends: 166896 [2021-12-06 23:26:50,683 INFO L226 Difference]: Without dead ends: 84255 [2021-12-06 23:26:50,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:26:50,782 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 404 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:26:50,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 661 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:26:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84255 states. [2021-12-06 23:26:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84255 to 84255. [2021-12-06 23:26:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84255 states, 73600 states have (on average 1.2654483695652174) internal successors, (93137), 74620 states have internal predecessors, (93137), 5363 states have call successors, (5363), 4011 states have call predecessors, (5363), 5290 states have return successors, (12169), 5631 states have call predecessors, (12169), 5360 states have call successors, (12169) [2021-12-06 23:26:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84255 states to 84255 states and 110669 transitions. [2021-12-06 23:26:57,783 INFO L78 Accepts]: Start accepts. Automaton has 84255 states and 110669 transitions. Word has length 192 [2021-12-06 23:26:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:26:57,783 INFO L470 AbstractCegarLoop]: Abstraction has 84255 states and 110669 transitions. [2021-12-06 23:26:57,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:26:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 84255 states and 110669 transitions. [2021-12-06 23:26:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 23:26:57,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:26:57,835 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:26:57,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-06 23:26:58,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:26:58,036 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:26:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:26:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash 505525492, now seen corresponding path program 1 times [2021-12-06 23:26:58,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:26:58,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880261535] [2021-12-06 23:26:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:58,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:26:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:26:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:26:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:26:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:26:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:26:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:26:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:26:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 23:26:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:26:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-06 23:26:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-06 23:26:58,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:26:58,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880261535] [2021-12-06 23:26:58,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880261535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:26:58,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732842031] [2021-12-06 23:26:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:26:58,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:26:58,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:26:58,117 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:26:58,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 23:26:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:26:58,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 23:26:58,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:26:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-06 23:26:58,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:26:58,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732842031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:26:58,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:26:58,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 23:26:58,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216611754] [2021-12-06 23:26:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:26:58,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:26:58,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:26:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:26:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:26:58,317 INFO L87 Difference]: Start difference. First operand 84255 states and 110669 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:27:04,030 INFO L93 Difference]: Finished difference Result 121633 states and 161314 transitions. [2021-12-06 23:27:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 23:27:04,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-06 23:27:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:27:04,176 INFO L225 Difference]: With dead ends: 121633 [2021-12-06 23:27:04,177 INFO L226 Difference]: Without dead ends: 65471 [2021-12-06 23:27:04,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:27:04,250 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 401 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:27:04,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 654 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:27:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65471 states. [2021-12-06 23:27:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65471 to 65135. [2021-12-06 23:27:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65135 states, 56946 states have (on average 1.2496926913216029) internal successors, (71165), 57653 states have internal predecessors, (71165), 4153 states have call successors, (4153), 3107 states have call predecessors, (4153), 4034 states have return successors, (9568), 4378 states have call predecessors, (9568), 4150 states have call successors, (9568) [2021-12-06 23:27:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65135 states to 65135 states and 84886 transitions. [2021-12-06 23:27:09,910 INFO L78 Accepts]: Start accepts. Automaton has 65135 states and 84886 transitions. Word has length 192 [2021-12-06 23:27:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:27:09,910 INFO L470 AbstractCegarLoop]: Abstraction has 65135 states and 84886 transitions. [2021-12-06 23:27:09,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 65135 states and 84886 transitions. [2021-12-06 23:27:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 23:27:09,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:27:09,935 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:27:09,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-06 23:27:10,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-12-06 23:27:10,136 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:27:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:27:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1282344330, now seen corresponding path program 1 times [2021-12-06 23:27:10,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:27:10,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482816521] [2021-12-06 23:27:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:10,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:27:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:27:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:27:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:27:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:27:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:27:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:27:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:27:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 23:27:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-06 23:27:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-06 23:27:10,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:27:10,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482816521] [2021-12-06 23:27:10,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482816521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:27:10,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599988176] [2021-12-06 23:27:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:10,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:27:10,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:27:10,236 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:27:10,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 23:27:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:10,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 23:27:10,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:27:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-06 23:27:10,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:27:10,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599988176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:27:10,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:27:10,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 23:27:10,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885101277] [2021-12-06 23:27:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:27:10,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:27:10,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:27:10,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:27:10,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:27:10,437 INFO L87 Difference]: Start difference. First operand 65135 states and 84886 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:27:16,139 INFO L93 Difference]: Finished difference Result 128494 states and 168210 transitions. [2021-12-06 23:27:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 23:27:16,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-06 23:27:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:27:16,284 INFO L225 Difference]: With dead ends: 128494 [2021-12-06 23:27:16,284 INFO L226 Difference]: Without dead ends: 64973 [2021-12-06 23:27:16,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:27:16,364 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 397 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 23:27:16,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 649 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 23:27:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64973 states. [2021-12-06 23:27:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64973 to 64973. [2021-12-06 23:27:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64973 states, 56784 states have (on average 1.2367744435052128) internal successors, (70229), 57491 states have internal predecessors, (70229), 4153 states have call successors, (4153), 3107 states have call predecessors, (4153), 4034 states have return successors, (9568), 4378 states have call predecessors, (9568), 4150 states have call successors, (9568) [2021-12-06 23:27:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64973 states to 64973 states and 83950 transitions. [2021-12-06 23:27:22,169 INFO L78 Accepts]: Start accepts. Automaton has 64973 states and 83950 transitions. Word has length 192 [2021-12-06 23:27:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:27:22,169 INFO L470 AbstractCegarLoop]: Abstraction has 64973 states and 83950 transitions. [2021-12-06 23:27:22,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 64973 states and 83950 transitions. [2021-12-06 23:27:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 23:27:22,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:27:22,194 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:27:22,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-06 23:27:22,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:27:22,395 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:27:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:27:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 876739764, now seen corresponding path program 1 times [2021-12-06 23:27:22,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:27:22,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461117898] [2021-12-06 23:27:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:22,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:27:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:27:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:27:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:27:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:27:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:27:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:27:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:27:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 23:27:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-06 23:27:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-06 23:27:22,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:27:22,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461117898] [2021-12-06 23:27:22,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461117898] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:27:22,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143036758] [2021-12-06 23:27:22,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:22,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:27:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:27:22,483 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:27:22,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-06 23:27:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:22,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 23:27:22,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:27:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-06 23:27:22,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:27:22,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143036758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:27:22,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:27:22,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 23:27:22,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789036475] [2021-12-06 23:27:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:27:22,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:27:22,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:27:22,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:27:22,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:27:22,690 INFO L87 Difference]: Start difference. First operand 64973 states and 83950 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:27:29,744 INFO L93 Difference]: Finished difference Result 137188 states and 182078 transitions. [2021-12-06 23:27:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:27:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2021-12-06 23:27:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:27:29,969 INFO L225 Difference]: With dead ends: 137188 [2021-12-06 23:27:29,969 INFO L226 Difference]: Without dead ends: 73825 [2021-12-06 23:27:30,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:27:30,058 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 435 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:27:30,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 660 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:27:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73825 states. [2021-12-06 23:27:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73825 to 65841. [2021-12-06 23:27:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65841 states, 57908 states have (on average 1.2037542308489328) internal successors, (69707), 58637 states have internal predecessors, (69707), 3933 states have call successors, (3933), 3061 states have call predecessors, (3933), 3998 states have return successors, (8392), 4146 states have call predecessors, (8392), 3930 states have call successors, (8392) [2021-12-06 23:27:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65841 states to 65841 states and 82032 transitions. [2021-12-06 23:27:36,176 INFO L78 Accepts]: Start accepts. Automaton has 65841 states and 82032 transitions. Word has length 192 [2021-12-06 23:27:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:27:36,176 INFO L470 AbstractCegarLoop]: Abstraction has 65841 states and 82032 transitions. [2021-12-06 23:27:36,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 65841 states and 82032 transitions. [2021-12-06 23:27:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 23:27:36,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:27:36,200 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:27:36,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-06 23:27:36,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-06 23:27:36,402 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:27:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:27:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -740700686, now seen corresponding path program 1 times [2021-12-06 23:27:36,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:27:36,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060637897] [2021-12-06 23:27:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:36,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:27:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:27:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:27:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:27:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:27:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:27:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:27:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:27:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 23:27:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-06 23:27:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-06 23:27:36,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:27:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060637897] [2021-12-06 23:27:36,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060637897] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:27:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827820262] [2021-12-06 23:27:36,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:36,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:27:36,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:27:36,492 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:27:36,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-06 23:27:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:36,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 23:27:36,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:27:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-12-06 23:27:36,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:27:36,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827820262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:27:36,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:27:36,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 23:27:36,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607000012] [2021-12-06 23:27:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:27:36,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:27:36,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:27:36,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:27:36,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:27:36,690 INFO L87 Difference]: Start difference. First operand 65841 states and 82032 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:27:44,924 INFO L93 Difference]: Finished difference Result 146291 states and 186545 transitions. [2021-12-06 23:27:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:27:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 192 [2021-12-06 23:27:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:27:45,102 INFO L225 Difference]: With dead ends: 146291 [2021-12-06 23:27:45,102 INFO L226 Difference]: Without dead ends: 82062 [2021-12-06 23:27:45,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:27:45,203 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 89 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:27:45,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1409 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:27:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82062 states. [2021-12-06 23:27:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82062 to 68476. [2021-12-06 23:27:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68476 states, 60357 states have (on average 1.1898702718823002) internal successors, (71817), 61275 states have internal predecessors, (71817), 3933 states have call successors, (3933), 3061 states have call predecessors, (3933), 4184 states have return successors, (8894), 4143 states have call predecessors, (8894), 3930 states have call successors, (8894) [2021-12-06 23:27:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68476 states to 68476 states and 84644 transitions. [2021-12-06 23:27:52,342 INFO L78 Accepts]: Start accepts. Automaton has 68476 states and 84644 transitions. Word has length 192 [2021-12-06 23:27:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:27:52,343 INFO L470 AbstractCegarLoop]: Abstraction has 68476 states and 84644 transitions. [2021-12-06 23:27:52,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 68476 states and 84644 transitions. [2021-12-06 23:27:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 23:27:52,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:27:52,368 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:27:52,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-06 23:27:52,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-12-06 23:27:52,569 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:27:52,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:27:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1931607636, now seen corresponding path program 1 times [2021-12-06 23:27:52,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:27:52,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842415832] [2021-12-06 23:27:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:52,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:27:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:27:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:27:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:27:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:27:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:27:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:27:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:27:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 23:27:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:27:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-06 23:27:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-06 23:27:52,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:27:52,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842415832] [2021-12-06 23:27:52,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842415832] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:27:52,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428930885] [2021-12-06 23:27:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:27:52,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:27:52,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:27:52,671 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:27:52,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-06 23:27:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:27:52,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 23:27:52,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:27:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-06 23:27:52,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:27:52,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428930885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:27:52,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:27:52,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 23:27:52,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794939076] [2021-12-06 23:27:52,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:27:52,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:27:52,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:27:52,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:27:52,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:27:52,870 INFO L87 Difference]: Start difference. First operand 68476 states and 84644 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:27:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:27:59,695 INFO L93 Difference]: Finished difference Result 134847 states and 169981 transitions. [2021-12-06 23:27:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:27:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 192 [2021-12-06 23:27:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:27:59,827 INFO L225 Difference]: With dead ends: 134847 [2021-12-06 23:27:59,827 INFO L226 Difference]: Without dead ends: 67983 [2021-12-06 23:27:59,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:27:59,901 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 49 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:27:59,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1382 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:27:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67983 states. [2021-12-06 23:28:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67983 to 66809. [2021-12-06 23:28:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66809 states, 58832 states have (on average 1.1711143595322273) internal successors, (68899), 59649 states have internal predecessors, (68899), 3933 states have call successors, (3933), 3061 states have call predecessors, (3933), 4042 states have return successors, (7727), 4102 states have call predecessors, (7727), 3930 states have call successors, (7727) [2021-12-06 23:28:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66809 states to 66809 states and 80559 transitions. [2021-12-06 23:28:06,754 INFO L78 Accepts]: Start accepts. Automaton has 66809 states and 80559 transitions. Word has length 192 [2021-12-06 23:28:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:06,754 INFO L470 AbstractCegarLoop]: Abstraction has 66809 states and 80559 transitions. [2021-12-06 23:28:06,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:28:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 66809 states and 80559 transitions. [2021-12-06 23:28:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-06 23:28:06,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:06,778 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:06,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-06 23:28:06,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-12-06 23:28:06,979 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1692792602, now seen corresponding path program 1 times [2021-12-06 23:28:06,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:06,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453240453] [2021-12-06 23:28:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:06,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:28:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-06 23:28:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 23:28:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-06 23:28:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-06 23:28:07,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:07,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453240453] [2021-12-06 23:28:07,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453240453] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:28:07,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562716790] [2021-12-06 23:28:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:07,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:07,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:28:07,073 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:28:07,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-06 23:28:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:07,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 23:28:07,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:28:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-06 23:28:07,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:28:07,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562716790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:07,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:28:07,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 23:28:07,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596065483] [2021-12-06 23:28:07,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:07,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:28:07,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:07,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:28:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:28:07,270 INFO L87 Difference]: Start difference. First operand 66809 states and 80559 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:28:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:13,110 INFO L93 Difference]: Finished difference Result 112027 states and 136793 transitions. [2021-12-06 23:28:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:28:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 192 [2021-12-06 23:28:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:13,198 INFO L225 Difference]: With dead ends: 112027 [2021-12-06 23:28:13,198 INFO L226 Difference]: Without dead ends: 46827 [2021-12-06 23:28:13,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:28:13,261 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 10 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:13,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1367 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:28:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46827 states. [2021-12-06 23:28:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46827 to 46615. [2021-12-06 23:28:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46615 states, 41170 states have (on average 1.1551858149137721) internal successors, (47559), 41659 states have internal predecessors, (47559), 2714 states have call successors, (2714), 2125 states have call predecessors, (2714), 2729 states have return successors, (4561), 2832 states have call predecessors, (4561), 2711 states have call successors, (4561) [2021-12-06 23:28:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46615 states to 46615 states and 54834 transitions. [2021-12-06 23:28:18,242 INFO L78 Accepts]: Start accepts. Automaton has 46615 states and 54834 transitions. Word has length 192 [2021-12-06 23:28:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:18,243 INFO L470 AbstractCegarLoop]: Abstraction has 46615 states and 54834 transitions. [2021-12-06 23:28:18,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 23:28:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 46615 states and 54834 transitions. [2021-12-06 23:28:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-12-06 23:28:18,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:18,264 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:18,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-06 23:28:18,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-12-06 23:28:18,466 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -647730294, now seen corresponding path program 1 times [2021-12-06 23:28:18,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:18,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120796871] [2021-12-06 23:28:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:18,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:28:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-06 23:28:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-06 23:28:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-06 23:28:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 23:28:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-12-06 23:28:18,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:18,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120796871] [2021-12-06 23:28:18,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120796871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:18,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:28:18,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:28:18,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105697935] [2021-12-06 23:28:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:18,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:28:18,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:18,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:28:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:28:18,556 INFO L87 Difference]: Start difference. First operand 46615 states and 54834 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-06 23:28:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:23,451 INFO L93 Difference]: Finished difference Result 78346 states and 92357 transitions. [2021-12-06 23:28:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 23:28:23,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 233 [2021-12-06 23:28:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:23,528 INFO L225 Difference]: With dead ends: 78346 [2021-12-06 23:28:23,528 INFO L226 Difference]: Without dead ends: 39132 [2021-12-06 23:28:23,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-06 23:28:23,575 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 1361 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:23,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1389 Valid, 1013 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 23:28:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39132 states. [2021-12-06 23:28:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39132 to 36837. [2021-12-06 23:28:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36837 states, 32562 states have (on average 1.1577298691726552) internal successors, (37698), 32982 states have internal predecessors, (37698), 2080 states have call successors, (2080), 1627 states have call predecessors, (2080), 2193 states have return successors, (3744), 2229 states have call predecessors, (3744), 2077 states have call successors, (3744) [2021-12-06 23:28:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36837 states to 36837 states and 43522 transitions. [2021-12-06 23:28:27,669 INFO L78 Accepts]: Start accepts. Automaton has 36837 states and 43522 transitions. Word has length 233 [2021-12-06 23:28:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:27,669 INFO L470 AbstractCegarLoop]: Abstraction has 36837 states and 43522 transitions. [2021-12-06 23:28:27,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-06 23:28:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36837 states and 43522 transitions. [2021-12-06 23:28:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-12-06 23:28:27,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:27,685 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:27,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-12-06 23:28:27,685 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1441178864, now seen corresponding path program 1 times [2021-12-06 23:28:27,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:27,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997616349] [2021-12-06 23:28:27,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:27,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:28:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:28:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:28:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:28:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:28:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:28:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 23:28:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:28:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 23:28:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 23:28:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:28:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:28:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 23:28:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 23:28:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-06 23:28:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-06 23:28:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 23:28:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-06 23:28:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-06 23:28:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:28:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:28:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 23:28:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-12-06 23:28:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 23:28:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-12-06 23:28:27,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:27,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997616349] [2021-12-06 23:28:27,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997616349] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:28:27,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245645067] [2021-12-06 23:28:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:27,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:28:27,751 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:28:27,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-06 23:28:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:27,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:28:27,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:28:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-06 23:28:27,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:28:27,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245645067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:27,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:28:27,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2021-12-06 23:28:27,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711757210] [2021-12-06 23:28:27,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:27,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:28:27,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:27,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:28:27,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:28:27,970 INFO L87 Difference]: Start difference. First operand 36837 states and 43522 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-06 23:28:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:31,762 INFO L93 Difference]: Finished difference Result 38310 states and 45305 transitions. [2021-12-06 23:28:31,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:28:31,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 252 [2021-12-06 23:28:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:31,825 INFO L225 Difference]: With dead ends: 38310 [2021-12-06 23:28:31,825 INFO L226 Difference]: Without dead ends: 36808 [2021-12-06 23:28:31,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:28:31,839 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 69 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:31,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 685 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:28:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36808 states. [2021-12-06 23:28:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36808 to 36803. [2021-12-06 23:28:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36803 states, 32532 states have (on average 1.1571990655354727) internal successors, (37646), 32952 states have internal predecessors, (37646), 2080 states have call successors, (2080), 1627 states have call predecessors, (2080), 2189 states have return successors, (3740), 2225 states have call predecessors, (3740), 2077 states have call successors, (3740) [2021-12-06 23:28:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36803 states to 36803 states and 43466 transitions. [2021-12-06 23:28:35,891 INFO L78 Accepts]: Start accepts. Automaton has 36803 states and 43466 transitions. Word has length 252 [2021-12-06 23:28:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:35,891 INFO L470 AbstractCegarLoop]: Abstraction has 36803 states and 43466 transitions. [2021-12-06 23:28:35,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-06 23:28:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 36803 states and 43466 transitions. [2021-12-06 23:28:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-12-06 23:28:35,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:35,958 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:35,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-12-06 23:28:36,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-12-06 23:28:36,160 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2031534197, now seen corresponding path program 1 times [2021-12-06 23:28:36,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:36,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422659936] [2021-12-06 23:28:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:36,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 23:28:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 23:28:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:28:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:28:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 23:28:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 23:28:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 23:28:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 23:28:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 23:28:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 23:28:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:28:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:28:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-06 23:28:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 23:28:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 23:28:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 23:28:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 23:28:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-06 23:28:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-06 23:28:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 23:28:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 23:28:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-12-06 23:28:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-12-06 23:28:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-06 23:28:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-12-06 23:28:36,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422659936] [2021-12-06 23:28:36,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422659936] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:28:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595498605] [2021-12-06 23:28:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:36,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:36,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:28:36,263 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:28:36,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-06 23:28:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:36,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 23:28:36,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:28:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-06 23:28:36,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 23:28:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-12-06 23:28:36,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595498605] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 23:28:36,725 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 23:28:36,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-06 23:28:36,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506401836] [2021-12-06 23:28:36,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 23:28:36,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:28:36,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:28:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:28:36,727 INFO L87 Difference]: Start difference. First operand 36803 states and 43466 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-06 23:28:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:40,914 INFO L93 Difference]: Finished difference Result 37167 states and 43871 transitions. [2021-12-06 23:28:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 23:28:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2021-12-06 23:28:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:40,974 INFO L225 Difference]: With dead ends: 37167 [2021-12-06 23:28:40,974 INFO L226 Difference]: Without dead ends: 35241 [2021-12-06 23:28:40,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 551 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-12-06 23:28:40,986 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 427 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:40,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 1437 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 23:28:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35241 states. [2021-12-06 23:28:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35241 to 35241. [2021-12-06 23:28:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35241 states, 31285 states have (on average 1.1573277928719834) internal successors, (36207), 31692 states have internal predecessors, (36207), 1926 states have call successors, (1926), 1497 states have call predecessors, (1926), 2029 states have return successors, (3510), 2053 states have call predecessors, (3510), 1924 states have call successors, (3510) [2021-12-06 23:28:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35241 states to 35241 states and 41643 transitions. [2021-12-06 23:28:44,926 INFO L78 Accepts]: Start accepts. Automaton has 35241 states and 41643 transitions. Word has length 253 [2021-12-06 23:28:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:44,926 INFO L470 AbstractCegarLoop]: Abstraction has 35241 states and 41643 transitions. [2021-12-06 23:28:44,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-06 23:28:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 35241 states and 41643 transitions. [2021-12-06 23:28:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-06 23:28:44,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:44,949 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:44,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-12-06 23:28:45,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:45,151 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 214354236, now seen corresponding path program 1 times [2021-12-06 23:28:45,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:45,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242931359] [2021-12-06 23:28:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:45,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:28:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 23:28:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-06 23:28:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-06 23:28:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2021-12-06 23:28:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-06 23:28:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2021-12-06 23:28:45,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:45,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242931359] [2021-12-06 23:28:45,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242931359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:28:45,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545670067] [2021-12-06 23:28:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:45,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:45,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:28:45,253 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:28:45,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-06 23:28:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:45,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:28:45,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:28:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-06 23:28:45,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:28:45,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545670067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:45,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:28:45,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:28:45,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106159756] [2021-12-06 23:28:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:45,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:28:45,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:28:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:28:45,508 INFO L87 Difference]: Start difference. First operand 35241 states and 41643 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 23:28:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:48,542 INFO L93 Difference]: Finished difference Result 63869 states and 77074 transitions. [2021-12-06 23:28:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:28:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 276 [2021-12-06 23:28:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:48,598 INFO L225 Difference]: With dead ends: 63869 [2021-12-06 23:28:48,598 INFO L226 Difference]: Without dead ends: 29002 [2021-12-06 23:28:48,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:28:48,643 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 163 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:48,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:28:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29002 states. [2021-12-06 23:28:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29002 to 21331. [2021-12-06 23:28:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21331 states, 18826 states have (on average 1.12610219908637) internal successors, (21200), 18985 states have internal predecessors, (21200), 1294 states have call successors, (1294), 993 states have call predecessors, (1294), 1210 states have return successors, (1880), 1353 states have call predecessors, (1880), 1292 states have call successors, (1880) [2021-12-06 23:28:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 24374 transitions. [2021-12-06 23:28:51,189 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 24374 transitions. Word has length 276 [2021-12-06 23:28:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:51,189 INFO L470 AbstractCegarLoop]: Abstraction has 21331 states and 24374 transitions. [2021-12-06 23:28:51,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 23:28:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 24374 transitions. [2021-12-06 23:28:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-06 23:28:51,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:51,201 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:51,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-12-06 23:28:51,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:51,403 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1699192761, now seen corresponding path program 1 times [2021-12-06 23:28:51,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:51,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002047211] [2021-12-06 23:28:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:51,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 23:28:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 23:28:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-06 23:28:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-06 23:28:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2021-12-06 23:28:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-06 23:28:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-12-06 23:28:51,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:51,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002047211] [2021-12-06 23:28:51,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002047211] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:28:51,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19019924] [2021-12-06 23:28:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:51,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:28:51,505 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:28:51,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-06 23:28:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:51,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 23:28:51,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:28:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-12-06 23:28:51,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:28:51,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19019924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:51,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:28:51,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 23:28:51,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325011235] [2021-12-06 23:28:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:51,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:28:51,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:51,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:28:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:28:51,742 INFO L87 Difference]: Start difference. First operand 21331 states and 24374 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 23:28:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:52,510 INFO L93 Difference]: Finished difference Result 26401 states and 30094 transitions. [2021-12-06 23:28:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:28:52,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 276 [2021-12-06 23:28:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:52,519 INFO L225 Difference]: With dead ends: 26401 [2021-12-06 23:28:52,520 INFO L226 Difference]: Without dead ends: 4806 [2021-12-06 23:28:52,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:28:52,540 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 162 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:52,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 494 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:28:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2021-12-06 23:28:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4806. [2021-12-06 23:28:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4806 states, 4211 states have (on average 1.0959392068392306) internal successors, (4615), 4232 states have internal predecessors, (4615), 340 states have call successors, (340), 239 states have call predecessors, (340), 254 states have return successors, (361), 335 states have call predecessors, (361), 338 states have call successors, (361) [2021-12-06 23:28:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 5316 transitions. [2021-12-06 23:28:53,036 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 5316 transitions. Word has length 276 [2021-12-06 23:28:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:53,037 INFO L470 AbstractCegarLoop]: Abstraction has 4806 states and 5316 transitions. [2021-12-06 23:28:53,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 23:28:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 5316 transitions. [2021-12-06 23:28:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-12-06 23:28:53,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:53,041 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:53,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-12-06 23:28:53,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-12-06 23:28:53,242 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash 184914899, now seen corresponding path program 1 times [2021-12-06 23:28:53,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:53,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867292282] [2021-12-06 23:28:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:53,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-06 23:28:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 23:28:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 23:28:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-06 23:28:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 23:28:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 23:28:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 49 proven. 43 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-06 23:28:53,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:53,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867292282] [2021-12-06 23:28:53,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867292282] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:28:53,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139692950] [2021-12-06 23:28:53,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:53,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:53,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:28:53,349 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:28:53,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-06 23:28:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:53,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:28:53,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:28:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-06 23:28:53,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:28:53,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139692950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:53,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:28:53,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 23:28:53,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621082472] [2021-12-06 23:28:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:53,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:28:53,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:53,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:28:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:28:53,584 INFO L87 Difference]: Start difference. First operand 4806 states and 5316 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 23:28:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:54,020 INFO L93 Difference]: Finished difference Result 7792 states and 8679 transitions. [2021-12-06 23:28:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:28:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 277 [2021-12-06 23:28:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:54,026 INFO L225 Difference]: With dead ends: 7792 [2021-12-06 23:28:54,026 INFO L226 Difference]: Without dead ends: 4806 [2021-12-06 23:28:54,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:28:54,030 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 156 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:54,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 492 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:28:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2021-12-06 23:28:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4806. [2021-12-06 23:28:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4806 states, 4211 states have (on average 1.0876276418902873) internal successors, (4580), 4232 states have internal predecessors, (4580), 340 states have call successors, (340), 239 states have call predecessors, (340), 254 states have return successors, (361), 335 states have call predecessors, (361), 338 states have call successors, (361) [2021-12-06 23:28:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 5281 transitions. [2021-12-06 23:28:54,467 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 5281 transitions. Word has length 277 [2021-12-06 23:28:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:54,467 INFO L470 AbstractCegarLoop]: Abstraction has 4806 states and 5281 transitions. [2021-12-06 23:28:54,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-06 23:28:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 5281 transitions. [2021-12-06 23:28:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2021-12-06 23:28:54,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:54,472 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:54,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-12-06 23:28:54,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-12-06 23:28:54,673 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash -698056312, now seen corresponding path program 1 times [2021-12-06 23:28:54,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:54,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144949500] [2021-12-06 23:28:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:54,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-06 23:28:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 23:28:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 23:28:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-06 23:28:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-06 23:28:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 23:28:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 71 proven. 102 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2021-12-06 23:28:54,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:54,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144949500] [2021-12-06 23:28:54,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144949500] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 23:28:54,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655605398] [2021-12-06 23:28:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:54,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 23:28:54,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:28:54,773 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 23:28:54,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-06 23:28:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:54,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 23:28:54,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 23:28:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-06 23:28:55,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 23:28:55,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655605398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:55,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 23:28:55,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-06 23:28:55,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281249850] [2021-12-06 23:28:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:55,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:28:55,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:28:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:28:55,027 INFO L87 Difference]: Start difference. First operand 4806 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 23:28:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:55,504 INFO L93 Difference]: Finished difference Result 8366 states and 9241 transitions. [2021-12-06 23:28:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:28:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 280 [2021-12-06 23:28:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:55,511 INFO L225 Difference]: With dead ends: 8366 [2021-12-06 23:28:55,511 INFO L226 Difference]: Without dead ends: 4806 [2021-12-06 23:28:55,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:28:55,514 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 123 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:55,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 445 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 23:28:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2021-12-06 23:28:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4806. [2021-12-06 23:28:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4806 states, 4211 states have (on average 1.0790786036570885) internal successors, (4544), 4232 states have internal predecessors, (4544), 340 states have call successors, (340), 239 states have call predecessors, (340), 254 states have return successors, (361), 335 states have call predecessors, (361), 338 states have call successors, (361) [2021-12-06 23:28:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 5245 transitions. [2021-12-06 23:28:55,953 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 5245 transitions. Word has length 280 [2021-12-06 23:28:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:55,953 INFO L470 AbstractCegarLoop]: Abstraction has 4806 states and 5245 transitions. [2021-12-06 23:28:55,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 23:28:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 5245 transitions. [2021-12-06 23:28:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-12-06 23:28:55,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:55,957 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:55,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-12-06 23:28:56,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-12-06 23:28:56,158 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash 390703402, now seen corresponding path program 1 times [2021-12-06 23:28:56,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:56,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645084399] [2021-12-06 23:28:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:56,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-06 23:28:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 23:28:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 23:28:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 23:28:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-06 23:28:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 23:28:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2021-12-06 23:28:56,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:56,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645084399] [2021-12-06 23:28:56,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645084399] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:56,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:28:56,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:28:56,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570397848] [2021-12-06 23:28:56,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:56,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:28:56,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:28:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:28:56,291 INFO L87 Difference]: Start difference. First operand 4806 states and 5245 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2021-12-06 23:28:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:57,535 INFO L93 Difference]: Finished difference Result 5164 states and 5620 transitions. [2021-12-06 23:28:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 23:28:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 283 [2021-12-06 23:28:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:57,542 INFO L225 Difference]: With dead ends: 5164 [2021-12-06 23:28:57,542 INFO L226 Difference]: Without dead ends: 5161 [2021-12-06 23:28:57,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-12-06 23:28:57,544 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 1089 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:57,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1132 Valid, 1551 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 23:28:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5161 states. [2021-12-06 23:28:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5161 to 5000. [2021-12-06 23:28:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5000 states, 4380 states have (on average 1.0780821917808219) internal successors, (4722), 4401 states have internal predecessors, (4722), 354 states have call successors, (354), 249 states have call predecessors, (354), 265 states have return successors, (377), 350 states have call predecessors, (377), 353 states have call successors, (377) [2021-12-06 23:28:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 5453 transitions. [2021-12-06 23:28:58,029 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 5453 transitions. Word has length 283 [2021-12-06 23:28:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:58,030 INFO L470 AbstractCegarLoop]: Abstraction has 5000 states and 5453 transitions. [2021-12-06 23:28:58,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2021-12-06 23:28:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 5453 transitions. [2021-12-06 23:28:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-12-06 23:28:58,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:58,034 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:58,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-12-06 23:28:58,035 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:58,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1466213266, now seen corresponding path program 1 times [2021-12-06 23:28:58,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:58,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873507726] [2021-12-06 23:28:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:58,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 23:28:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 23:28:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 23:28:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 23:28:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 23:28:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-06 23:28:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 23:28:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 23:28:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 23:28:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-06 23:28:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 23:28:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 23:28:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:28:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2021-12-06 23:28:58,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:28:58,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873507726] [2021-12-06 23:28:58,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873507726] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:28:58,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:28:58,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 23:28:58,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903012114] [2021-12-06 23:28:58,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:28:58,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 23:28:58,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:28:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 23:28:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 23:28:58,101 INFO L87 Difference]: Start difference. First operand 5000 states and 5453 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 23:28:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 23:28:58,844 INFO L93 Difference]: Finished difference Result 6983 states and 7693 transitions. [2021-12-06 23:28:58,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 23:28:58,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 287 [2021-12-06 23:28:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 23:28:58,853 INFO L225 Difference]: With dead ends: 6983 [2021-12-06 23:28:58,853 INFO L226 Difference]: Without dead ends: 5583 [2021-12-06 23:28:58,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:28:58,855 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 248 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 23:28:58,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 688 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 23:28:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2021-12-06 23:28:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 5002. [2021-12-06 23:28:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5002 states, 4382 states have (on average 1.0780465540848927) internal successors, (4724), 4403 states have internal predecessors, (4724), 354 states have call successors, (354), 249 states have call predecessors, (354), 265 states have return successors, (377), 350 states have call predecessors, (377), 353 states have call successors, (377) [2021-12-06 23:28:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 5455 transitions. [2021-12-06 23:28:59,337 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 5455 transitions. Word has length 287 [2021-12-06 23:28:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 23:28:59,337 INFO L470 AbstractCegarLoop]: Abstraction has 5002 states and 5455 transitions. [2021-12-06 23:28:59,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 23:28:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 5455 transitions. [2021-12-06 23:28:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2021-12-06 23:28:59,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 23:28:59,342 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:59,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-12-06 23:28:59,342 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 23:28:59,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:28:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash -563040702, now seen corresponding path program 1 times [2021-12-06 23:28:59,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:28:59,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924021314] [2021-12-06 23:28:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:28:59,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:28:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:28:59,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 23:28:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:28:59,473 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 23:28:59,473 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 23:28:59,474 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 23:28:59,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 23:28:59,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-12-06 23:28:59,478 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:28:59,480 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 23:28:59,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 11:28:59 BoogieIcfgContainer [2021-12-06 23:28:59,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 23:28:59,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 23:28:59,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 23:28:59,630 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 23:28:59,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:24:40" (3/4) ... [2021-12-06 23:28:59,631 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 23:28:59,779 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 23:28:59,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 23:28:59,779 INFO L158 Benchmark]: Toolchain (without parser) took 260072.73ms. Allocated memory was 86.0MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 49.6MB in the beginning and 681.6MB in the end (delta: -632.0MB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2021-12-06 23:28:59,779 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 23:28:59,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.67ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 49.4MB in the beginning and 88.8MB in the end (delta: -39.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 23:28:59,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.63ms. Allocated memory is still 119.5MB. Free memory was 88.8MB in the beginning and 85.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 23:28:59,780 INFO L158 Benchmark]: Boogie Preprocessor took 32.03ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 83.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 23:28:59,780 INFO L158 Benchmark]: RCFGBuilder took 482.55ms. Allocated memory is still 119.5MB. Free memory was 83.1MB in the beginning and 55.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-06 23:28:59,780 INFO L158 Benchmark]: TraceAbstraction took 259019.85ms. Allocated memory was 119.5MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 55.3MB in the beginning and 736.4MB in the end (delta: -681.1MB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2021-12-06 23:28:59,780 INFO L158 Benchmark]: Witness Printer took 149.41ms. Allocated memory is still 4.4GB. Free memory was 736.4MB in the beginning and 681.6MB in the end (delta: 54.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2021-12-06 23:28:59,781 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.67ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 49.4MB in the beginning and 88.8MB in the end (delta: -39.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.63ms. Allocated memory is still 119.5MB. Free memory was 88.8MB in the beginning and 85.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.03ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 83.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 482.55ms. Allocated memory is still 119.5MB. Free memory was 83.1MB in the beginning and 55.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 259019.85ms. Allocated memory was 119.5MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 55.3MB in the beginning and 736.4MB in the end (delta: -681.1MB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 149.41ms. Allocated memory is still 4.4GB. Free memory was 736.4MB in the beginning and 681.6MB in the end (delta: 54.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int m_st ; [L505] int t1_st ; [L506] int t2_st ; [L507] int t3_st ; [L508] int m_i ; [L509] int t1_i ; [L510] int t2_i ; [L511] int t3_i ; [L512] int M_E = 2; [L513] int T1_E = 2; [L514] int T2_E = 2; [L515] int T3_E = 2; [L516] int E_M = 2; [L517] int E_1 = 2; [L518] int E_2 = 2; [L519] int E_3 = 2; [L525] int token ; [L527] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L1224] COND FALSE !(__VERIFIER_nondet_int()) [L1227] CALL main2() [L1211] int __retres1 ; [L1215] CALL init_model2() [L1124] m_i = 1 [L1125] t1_i = 1 [L1126] t2_i = 1 [L1127] t3_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1215] RET init_model2() [L1216] CALL start_simulation2() [L1152] int kernel_st ; [L1153] int tmp ; [L1154] int tmp___0 ; [L1158] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1159] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1160] CALL init_threads2() [L780] COND TRUE m_i == 1 [L781] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L785] COND TRUE t1_i == 1 [L786] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L790] COND TRUE t2_i == 1 [L791] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L795] COND TRUE t3_i == 1 [L796] t3_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1160] RET init_threads2() [L1161] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L917] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L922] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L927] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L932] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L937] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L942] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L947] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L952] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1161] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1162] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L696] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L706] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L708] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L715] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L727] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L734] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L746] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L753] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L763] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L765] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L1162] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1163] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L965] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L970] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L975] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L980] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L985] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L990] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L995] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1000] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1163] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1166] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1169] kernel_st = 1 [L1170] CALL eval2() [L836] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L840] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L843] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L805] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L808] COND TRUE m_st == 0 [L809] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L831] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L843] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L843] tmp = exists_runnable_thread2() [L845] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L850] COND TRUE m_st == 0 [L851] int tmp_ndt_1; [L852] tmp_ndt_1 = __VERIFIER_nondet_int() [L853] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L864] COND TRUE t1_st == 0 [L865] int tmp_ndt_2; [L866] tmp_ndt_2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp_ndt_2) [L869] t1_st = 1 [L870] CALL transmit1() [L588] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L599] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L601] t1_pc = 1 [L602] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L870] RET transmit1() [L878] COND TRUE t2_st == 0 [L879] int tmp_ndt_3; [L880] tmp_ndt_3 = __VERIFIER_nondet_int() [L881] COND TRUE \read(tmp_ndt_3) [L883] t2_st = 1 [L884] CALL transmit2() [L624] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L635] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L637] t2_pc = 1 [L638] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L884] RET transmit2() [L892] COND TRUE t3_st == 0 [L893] int tmp_ndt_4; [L894] tmp_ndt_4 = __VERIFIER_nondet_int() [L895] COND TRUE \read(tmp_ndt_4) [L897] t3_st = 1 [L898] CALL transmit3() [L660] COND TRUE t3_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L671] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L673] t3_pc = 1 [L674] t3_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L898] RET transmit3() [L840] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-1, token=0] [L843] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L805] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L808] COND TRUE m_st == 0 [L809] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L831] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L843] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-1, token=0] [L843] tmp = exists_runnable_thread2() [L845] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-1, token=0] [L850] COND TRUE m_st == 0 [L851] int tmp_ndt_1; [L852] tmp_ndt_1 = __VERIFIER_nondet_int() [L853] COND TRUE \read(tmp_ndt_1) [L855] m_st = 1 [L856] CALL master() [L530] int tmp_var = __VERIFIER_nondet_int(); [L532] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L543] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L546] token = __VERIFIER_nondet_int() [L547] local = token [L548] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L549] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1057] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L696] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L706] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L708] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L716] COND TRUE E_1 == 1 [L717] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L727] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND TRUE \read(tmp___0) [L1028] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L735] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L746] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L754] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L763] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L765] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L1057] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L550] E_1 = 2 [L551] m_pc = 1 [L552] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L856] RET master() [L864] COND TRUE t1_st == 0 [L865] int tmp_ndt_2; [L866] tmp_ndt_2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp_ndt_2) [L869] t1_st = 1 [L870] CALL transmit1() [L588] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L591] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L607] token += 1 [L608] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L609] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1057] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L696] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L697] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L706] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L708] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L716] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L725] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L735] COND TRUE E_2 == 1 [L736] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND TRUE \read(tmp___1) [L1036] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L754] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L763] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L765] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L1057] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L609] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L610] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L599] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L601] t1_pc = 1 [L602] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L870] RET transmit1() [L878] COND TRUE t2_st == 0 [L879] int tmp_ndt_3; [L880] tmp_ndt_3 = __VERIFIER_nondet_int() [L881] COND TRUE \read(tmp_ndt_3) [L883] t2_st = 1 [L884] CALL transmit2() [L624] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L627] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L643] token += 1 [L644] E_3 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L645] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1057] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L696] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L697] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L706] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L708] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L716] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L725] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L735] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L754] COND TRUE E_3 == 1 [L755] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L765] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND TRUE \read(tmp___2) [L1044] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L1057] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L645] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L646] E_3 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L635] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L637] t2_pc = 1 [L638] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L884] RET transmit2() [L892] COND TRUE t3_st == 0 [L893] int tmp_ndt_4; [L894] tmp_ndt_4 = __VERIFIER_nondet_int() [L895] COND TRUE \read(tmp_ndt_4) [L897] t3_st = 1 [L898] CALL transmit3() [L660] COND FALSE !(t3_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L663] COND TRUE t3_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L679] token += 1 [L680] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L681] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1057] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L696] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L697] COND TRUE E_M == 1 [L698] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L708] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND TRUE \read(tmp) [L1020] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L716] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L725] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L735] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L754] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L763] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L765] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L1057] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L681] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L682] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L671] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L673] t3_pc = 1 [L674] t3_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L898] RET transmit3() [L840] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-2, token=3] [L843] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L805] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L808] COND TRUE m_st == 0 [L809] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L831] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L843] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-2, token=3] [L843] tmp = exists_runnable_thread2() [L845] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-2, token=3] [L850] COND TRUE m_st == 0 [L851] int tmp_ndt_1; [L852] tmp_ndt_1 = __VERIFIER_nondet_int() [L853] COND TRUE \read(tmp_ndt_1) [L855] m_st = 1 [L856] CALL master() [L530] int tmp_var = __VERIFIER_nondet_int(); [L532] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L535] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L557] COND FALSE !(token != local + 3) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L562] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L563] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L568] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L569] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L570] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L571] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 266 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 258.8s, OverallIterations: 59, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.0s, AutomataDifference: 130.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32268 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31546 mSDsluCounter, 56561 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34193 mSDsCounter, 5423 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24795 IncrementalHoareTripleChecker+Invalid, 30218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5423 mSolverCounterUnsat, 22368 mSDtfsCounter, 24795 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8036 GetRequests, 7404 SyntacticMatches, 12 SemanticMatches, 620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84255occurred in iteration=42, InterpolantAutomatonStates: 524, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 110.0s AutomataMinimizationTime, 58 MinimizatonAttempts, 66685 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 14610 NumberOfCodeBlocks, 14610 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 14721 ConstructedInterpolants, 0 QuantifiedInterpolants, 26204 SizeOfPredicates, 13 NumberOfNonLiveVariables, 19369 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 90 InterpolantComputations, 55 PerfectInterpolantSequences, 9528/10289 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 23:28:59,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df7556b-ba35-4440-9a94-46738435f541/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE