./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/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_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/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_b65c482b-228a-45e6-bca9-fc6dae245b65/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 a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:50:36,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:50:36,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:50:36,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:50:36,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:50:36,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:50:36,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:50:36,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:50:36,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:50:36,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:50:36,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:50:36,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:50:36,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:50:36,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:50:36,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:50:36,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:50:36,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:50:36,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:50:36,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:50:36,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:50:36,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:50:36,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:50:36,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:50:36,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:50:36,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:50:36,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:50:36,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:50:36,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:50:36,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:50:36,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:50:36,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:50:36,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:50:36,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:50:36,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:50:36,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:50:36,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:50:36,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:50:36,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:50:36,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:50:36,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:50:36,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:50:36,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:50:36,267 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:50:36,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:50:36,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:50:36,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:50:36,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:50:36,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:50:36,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:50:36,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:50:36,269 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:50:36,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:50:36,269 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:50:36,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:50:36,271 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:50:36,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:50:36,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:50:36,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:50:36,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:50:36,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:50:36,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:50:36,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:50:36,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:50:36,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:50:36,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:50:36,272 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:50:36,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:50:36,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:50:36,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:50:36,273 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_b65c482b-228a-45e6-bca9-fc6dae245b65/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_b65c482b-228a-45e6-bca9-fc6dae245b65/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 -> a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb [2021-12-06 19:50:36,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:50:36,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:50:36,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:50:36,470 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:50:36,471 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:50:36,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2021-12-06 19:50:36,512 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/data/c9c5eac06/3db3bf2fe0d04a70ba516133e6232368/FLAGd7e3a7169 [2021-12-06 19:50:36,879 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:50:36,879 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2021-12-06 19:50:36,888 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/data/c9c5eac06/3db3bf2fe0d04a70ba516133e6232368/FLAGd7e3a7169 [2021-12-06 19:50:36,897 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/data/c9c5eac06/3db3bf2fe0d04a70ba516133e6232368 [2021-12-06 19:50:36,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:50:36,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:50:36,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:50:36,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:50:36,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:50:36,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:50:36" (1/1) ... [2021-12-06 19:50:36,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3786f83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:36, skipping insertion in model container [2021-12-06 19:50:36,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:50:36" (1/1) ... [2021-12-06 19:50:36,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:50:36,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:50:37,048 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_b65c482b-228a-45e6-bca9-fc6dae245b65/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2021-12-06 19:50:37,077 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_b65c482b-228a-45e6-bca9-fc6dae245b65/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2021-12-06 19:50:37,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:50:37,110 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:50:37,119 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_b65c482b-228a-45e6-bca9-fc6dae245b65/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2021-12-06 19:50:37,131 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_b65c482b-228a-45e6-bca9-fc6dae245b65/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2021-12-06 19:50:37,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:50:37,163 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:50:37,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37 WrapperNode [2021-12-06 19:50:37,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:50:37,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:50:37,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:50:37,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:50:37,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,205 INFO L137 Inliner]: procedures = 52, calls = 55, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 480 [2021-12-06 19:50:37,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:50:37,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:50:37,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:50:37,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:50:37,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:50:37,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:50:37,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:50:37,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:50:37,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (1/1) ... [2021-12-06 19:50:37,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:50:37,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:37,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:50:37,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:50:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:50:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 19:50:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 19:50:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-12-06 19:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-12-06 19:50:37,294 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 19:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 19:50:37,294 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 19:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 19:50:37,294 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 19:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 19:50:37,294 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 19:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 19:50:37,294 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 19:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 19:50:37,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:50:37,295 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 19:50:37,295 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 19:50:37,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:50:37,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:50:37,295 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 19:50:37,295 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 19:50:37,295 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-06 19:50:37,295 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-06 19:50:37,364 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:50:37,366 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:50:37,707 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:50:37,716 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:50:37,716 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-06 19:50:37,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:50:37 BoogieIcfgContainer [2021-12-06 19:50:37,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:50:37,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:50:37,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:50:37,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:50:37,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:50:36" (1/3) ... [2021-12-06 19:50:37,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6aba06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:50:37, skipping insertion in model container [2021-12-06 19:50:37,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:50:37" (2/3) ... [2021-12-06 19:50:37,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6aba06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:50:37, skipping insertion in model container [2021-12-06 19:50:37,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:50:37" (3/3) ... [2021-12-06 19:50:37,727 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2021-12-06 19:50:37,731 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:50:37,732 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 19:50:37,768 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:50:37,775 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:50:37,775 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 19:50:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 175 states have (on average 1.5771428571428572) internal successors, (276), 182 states have internal predecessors, (276), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2021-12-06 19:50:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 19:50:37,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:37,807 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] [2021-12-06 19:50:37,808 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2045589042, now seen corresponding path program 1 times [2021-12-06 19:50:37,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:37,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158318845] [2021-12-06 19:50:37,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:37,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:50:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:38,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:38,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158318845] [2021-12-06 19:50:38,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158318845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:38,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:38,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:50:38,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517102349] [2021-12-06 19:50:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:38,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:50:38,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:50:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:50:38,038 INFO L87 Difference]: Start difference. First operand has 212 states, 175 states have (on average 1.5771428571428572) internal successors, (276), 182 states have internal predecessors, (276), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:50:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:38,222 INFO L93 Difference]: Finished difference Result 478 states and 736 transitions. [2021-12-06 19:50:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:50:38,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-06 19:50:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:38,234 INFO L225 Difference]: With dead ends: 478 [2021-12-06 19:50:38,234 INFO L226 Difference]: Without dead ends: 271 [2021-12-06 19:50:38,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:50:38,241 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 357 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:38,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 551 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:50:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-06 19:50:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2021-12-06 19:50:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 229 states have internal predecessors, (323), 28 states have call successors, (28), 12 states have call predecessors, (28), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2021-12-06 19:50:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 381 transitions. [2021-12-06 19:50:38,292 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 381 transitions. Word has length 44 [2021-12-06 19:50:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:38,293 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 381 transitions. [2021-12-06 19:50:38,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:50:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 381 transitions. [2021-12-06 19:50:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 19:50:38,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:38,296 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] [2021-12-06 19:50:38,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:50:38,297 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash 899257869, now seen corresponding path program 1 times [2021-12-06 19:50:38,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:38,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683324969] [2021-12-06 19:50:38,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:38,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-06 19:50:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:38,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:38,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683324969] [2021-12-06 19:50:38,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683324969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:38,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:38,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:50:38,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023171266] [2021-12-06 19:50:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:38,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:50:38,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:50:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:50:38,359 INFO L87 Difference]: Start difference. First operand 265 states and 381 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:50:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:38,517 INFO L93 Difference]: Finished difference Result 513 states and 721 transitions. [2021-12-06 19:50:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:50:38,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-12-06 19:50:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:38,521 INFO L225 Difference]: With dead ends: 513 [2021-12-06 19:50:38,522 INFO L226 Difference]: Without dead ends: 389 [2021-12-06 19:50:38,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:50:38,524 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 169 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:38,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 698 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:50:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-12-06 19:50:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 332. [2021-12-06 19:50:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 285 states have (on average 1.4280701754385965) internal successors, (407), 290 states have internal predecessors, (407), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2021-12-06 19:50:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 471 transitions. [2021-12-06 19:50:38,561 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 471 transitions. Word has length 45 [2021-12-06 19:50:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:38,561 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 471 transitions. [2021-12-06 19:50:38,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:50:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 471 transitions. [2021-12-06 19:50:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 19:50:38,563 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:38,564 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] [2021-12-06 19:50:38,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:50:38,564 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash -385099592, now seen corresponding path program 1 times [2021-12-06 19:50:38,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:38,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695389322] [2021-12-06 19:50:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:38,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-06 19:50:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:38,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695389322] [2021-12-06 19:50:38,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695389322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:38,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:38,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:50:38,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885378614] [2021-12-06 19:50:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:38,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:50:38,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:38,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:50:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:50:38,614 INFO L87 Difference]: Start difference. First operand 332 states and 471 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:50:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:38,708 INFO L93 Difference]: Finished difference Result 740 states and 1030 transitions. [2021-12-06 19:50:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:50:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-12-06 19:50:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:38,712 INFO L225 Difference]: With dead ends: 740 [2021-12-06 19:50:38,712 INFO L226 Difference]: Without dead ends: 549 [2021-12-06 19:50:38,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:50:38,714 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 366 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:38,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 545 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:50:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-12-06 19:50:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 497. [2021-12-06 19:50:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 431 states have (on average 1.3851508120649652) internal successors, (597), 439 states have internal predecessors, (597), 42 states have call successors, (42), 22 states have call predecessors, (42), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2021-12-06 19:50:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 689 transitions. [2021-12-06 19:50:38,743 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 689 transitions. Word has length 45 [2021-12-06 19:50:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:38,743 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 689 transitions. [2021-12-06 19:50:38,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 19:50:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 689 transitions. [2021-12-06 19:50:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 19:50:38,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:38,747 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] [2021-12-06 19:50:38,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 19:50:38,747 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash -748902494, now seen corresponding path program 1 times [2021-12-06 19:50:38,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:38,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542149567] [2021-12-06 19:50:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:38,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 19:50:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:50:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 19:50:38,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:38,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542149567] [2021-12-06 19:50:38,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542149567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:38,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:38,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:50:38,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45994462] [2021-12-06 19:50:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:38,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:50:38,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:50:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:50:38,802 INFO L87 Difference]: Start difference. First operand 497 states and 689 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:50:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:38,969 INFO L93 Difference]: Finished difference Result 1081 states and 1474 transitions. [2021-12-06 19:50:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:50:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2021-12-06 19:50:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:38,976 INFO L225 Difference]: With dead ends: 1081 [2021-12-06 19:50:38,976 INFO L226 Difference]: Without dead ends: 725 [2021-12-06 19:50:38,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:50:38,979 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 153 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:38,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 735 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:50:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-12-06 19:50:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 687. [2021-12-06 19:50:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 597 states have (on average 1.3350083752093802) internal successors, (797), 607 states have internal predecessors, (797), 56 states have call successors, (56), 30 states have call predecessors, (56), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2021-12-06 19:50:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 927 transitions. [2021-12-06 19:50:39,022 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 927 transitions. Word has length 62 [2021-12-06 19:50:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:39,022 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 927 transitions. [2021-12-06 19:50:39,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:50:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 927 transitions. [2021-12-06 19:50:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 19:50:39,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:39,025 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] [2021-12-06 19:50:39,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 19:50:39,025 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash -80982464, now seen corresponding path program 1 times [2021-12-06 19:50:39,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:39,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372249042] [2021-12-06 19:50:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:39,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 19:50:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 19:50:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 19:50:39,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372249042] [2021-12-06 19:50:39,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372249042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:39,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:39,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:50:39,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434414083] [2021-12-06 19:50:39,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:39,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:50:39,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:50:39,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:50:39,072 INFO L87 Difference]: Start difference. First operand 687 states and 927 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:50:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:39,180 INFO L93 Difference]: Finished difference Result 1340 states and 1780 transitions. [2021-12-06 19:50:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:50:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2021-12-06 19:50:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:39,185 INFO L225 Difference]: With dead ends: 1340 [2021-12-06 19:50:39,185 INFO L226 Difference]: Without dead ends: 886 [2021-12-06 19:50:39,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:50:39,187 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 353 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:39,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 542 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:50:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-12-06 19:50:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 831. [2021-12-06 19:50:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 725 states have (on average 1.3075862068965518) internal successors, (948), 737 states have internal predecessors, (948), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2021-12-06 19:50:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1100 transitions. [2021-12-06 19:50:39,223 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1100 transitions. Word has length 67 [2021-12-06 19:50:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:39,224 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1100 transitions. [2021-12-06 19:50:39,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:50:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1100 transitions. [2021-12-06 19:50:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:39,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:39,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:39,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 19:50:39,226 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:39,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash -294715005, now seen corresponding path program 1 times [2021-12-06 19:50:39,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:39,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788992879] [2021-12-06 19:50:39,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:39,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:39,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:39,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788992879] [2021-12-06 19:50:39,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788992879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:39,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:39,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:50:39,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923345688] [2021-12-06 19:50:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:39,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:50:39,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:39,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:50:39,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:50:39,295 INFO L87 Difference]: Start difference. First operand 831 states and 1100 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:39,799 INFO L93 Difference]: Finished difference Result 1141 states and 1571 transitions. [2021-12-06 19:50:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:50:39,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:50:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:39,804 INFO L225 Difference]: With dead ends: 1141 [2021-12-06 19:50:39,804 INFO L226 Difference]: Without dead ends: 1017 [2021-12-06 19:50:39,805 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 19:50:39,806 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 566 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:39,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 858 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:50:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-12-06 19:50:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 952. [2021-12-06 19:50:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 828 states have (on average 1.3333333333333333) internal successors, (1104), 841 states have internal predecessors, (1104), 75 states have call successors, (75), 42 states have call predecessors, (75), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2021-12-06 19:50:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1281 transitions. [2021-12-06 19:50:39,857 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1281 transitions. Word has length 69 [2021-12-06 19:50:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:39,858 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1281 transitions. [2021-12-06 19:50:39,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1281 transitions. [2021-12-06 19:50:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:39,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:39,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:39,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 19:50:39,860 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -192000641, now seen corresponding path program 1 times [2021-12-06 19:50:39,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:39,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393213508] [2021-12-06 19:50:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:39,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:39,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393213508] [2021-12-06 19:50:39,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393213508] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:39,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:39,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:50:39,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068280783] [2021-12-06 19:50:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:39,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:50:39,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:39,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:50:39,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:39,950 INFO L87 Difference]: Start difference. First operand 952 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:40,569 INFO L93 Difference]: Finished difference Result 1414 states and 1975 transitions. [2021-12-06 19:50:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:50:40,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:50:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:40,575 INFO L225 Difference]: With dead ends: 1414 [2021-12-06 19:50:40,575 INFO L226 Difference]: Without dead ends: 1169 [2021-12-06 19:50:40,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:50:40,577 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 554 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:40,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 1332 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:50:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-12-06 19:50:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1066. [2021-12-06 19:50:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 924 states have (on average 1.3484848484848484) internal successors, (1246), 938 states have internal predecessors, (1246), 86 states have call successors, (86), 48 states have call predecessors, (86), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2021-12-06 19:50:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1447 transitions. [2021-12-06 19:50:40,625 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1447 transitions. Word has length 69 [2021-12-06 19:50:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:40,625 INFO L470 AbstractCegarLoop]: Abstraction has 1066 states and 1447 transitions. [2021-12-06 19:50:40,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1447 transitions. [2021-12-06 19:50:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:40,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:40,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] [2021-12-06 19:50:40,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 19:50:40,627 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1194784769, now seen corresponding path program 1 times [2021-12-06 19:50:40,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:40,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177410942] [2021-12-06 19:50:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:40,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:40,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:40,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:40,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:40,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 19:50:40,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:40,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177410942] [2021-12-06 19:50:40,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177410942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:40,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:40,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:50:40,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464832867] [2021-12-06 19:50:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:40,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:50:40,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:40,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:50:40,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:40,690 INFO L87 Difference]: Start difference. First operand 1066 states and 1447 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:41,010 INFO L93 Difference]: Finished difference Result 1526 states and 2145 transitions. [2021-12-06 19:50:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:50:41,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:50:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:41,016 INFO L225 Difference]: With dead ends: 1526 [2021-12-06 19:50:41,016 INFO L226 Difference]: Without dead ends: 1167 [2021-12-06 19:50:41,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:50:41,018 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 549 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:41,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 680 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:50:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2021-12-06 19:50:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1066. [2021-12-06 19:50:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 924 states have (on average 1.3452380952380953) internal successors, (1243), 938 states have internal predecessors, (1243), 86 states have call successors, (86), 48 states have call predecessors, (86), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2021-12-06 19:50:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1444 transitions. [2021-12-06 19:50:41,071 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1444 transitions. Word has length 69 [2021-12-06 19:50:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:41,071 INFO L470 AbstractCegarLoop]: Abstraction has 1066 states and 1444 transitions. [2021-12-06 19:50:41,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1444 transitions. [2021-12-06 19:50:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:41,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:41,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:41,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 19:50:41,073 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2070803775, now seen corresponding path program 1 times [2021-12-06 19:50:41,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:41,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243617251] [2021-12-06 19:50:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:41,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:41,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:41,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243617251] [2021-12-06 19:50:41,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243617251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:41,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:41,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:50:41,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167451037] [2021-12-06 19:50:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:41,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:50:41,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:41,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:50:41,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:41,139 INFO L87 Difference]: Start difference. First operand 1066 states and 1444 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:41,748 INFO L93 Difference]: Finished difference Result 1884 states and 2653 transitions. [2021-12-06 19:50:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:50:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:50:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:41,756 INFO L225 Difference]: With dead ends: 1884 [2021-12-06 19:50:41,756 INFO L226 Difference]: Without dead ends: 1525 [2021-12-06 19:50:41,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:50:41,758 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 638 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:41,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 1306 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:50:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2021-12-06 19:50:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1291. [2021-12-06 19:50:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1115 states have (on average 1.3677130044843049) internal successors, (1525), 1131 states have internal predecessors, (1525), 106 states have call successors, (106), 60 states have call predecessors, (106), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2021-12-06 19:50:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1774 transitions. [2021-12-06 19:50:41,812 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1774 transitions. Word has length 69 [2021-12-06 19:50:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:41,813 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 1774 transitions. [2021-12-06 19:50:41,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1774 transitions. [2021-12-06 19:50:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:41,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:41,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:41,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 19:50:41,815 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1780262847, now seen corresponding path program 1 times [2021-12-06 19:50:41,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:41,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812655525] [2021-12-06 19:50:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:41,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:41,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:41,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812655525] [2021-12-06 19:50:41,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812655525] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:41,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:41,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:50:41,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042382289] [2021-12-06 19:50:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:41,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:50:41,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:41,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:50:41,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:41,872 INFO L87 Difference]: Start difference. First operand 1291 states and 1774 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:42,518 INFO L93 Difference]: Finished difference Result 2669 states and 3801 transitions. [2021-12-06 19:50:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:50:42,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:50:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:42,531 INFO L225 Difference]: With dead ends: 2669 [2021-12-06 19:50:42,531 INFO L226 Difference]: Without dead ends: 2085 [2021-12-06 19:50:42,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:50:42,534 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 550 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:42,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1326 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:50:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2021-12-06 19:50:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1695. [2021-12-06 19:50:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1453 states have (on average 1.3840330350997936) internal successors, (2011), 1473 states have internal predecessors, (2011), 144 states have call successors, (144), 84 states have call predecessors, (144), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) [2021-12-06 19:50:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2358 transitions. [2021-12-06 19:50:42,610 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2358 transitions. Word has length 69 [2021-12-06 19:50:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:42,610 INFO L470 AbstractCegarLoop]: Abstraction has 1695 states and 2358 transitions. [2021-12-06 19:50:42,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2358 transitions. [2021-12-06 19:50:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:42,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:42,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:42,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 19:50:42,613 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash -241922817, now seen corresponding path program 1 times [2021-12-06 19:50:42,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:42,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909025840] [2021-12-06 19:50:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:42,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:42,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:42,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:42,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:42,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:42,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909025840] [2021-12-06 19:50:42,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909025840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:42,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:42,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:50:42,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334575121] [2021-12-06 19:50:42,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:42,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:50:42,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:42,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:50:42,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:42,666 INFO L87 Difference]: Start difference. First operand 1695 states and 2358 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:43,244 INFO L93 Difference]: Finished difference Result 4023 states and 5760 transitions. [2021-12-06 19:50:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 19:50:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:50:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:43,257 INFO L225 Difference]: With dead ends: 4023 [2021-12-06 19:50:43,257 INFO L226 Difference]: Without dead ends: 3035 [2021-12-06 19:50:43,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 19:50:43,260 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 554 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:43,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [570 Valid, 1277 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:50:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2021-12-06 19:50:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2531. [2021-12-06 19:50:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2165 states have (on average 1.410161662817552) internal successors, (3053), 2193 states have internal predecessors, (3053), 214 states have call successors, (214), 130 states have call predecessors, (214), 150 states have return successors, (335), 223 states have call predecessors, (335), 210 states have call successors, (335) [2021-12-06 19:50:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3602 transitions. [2021-12-06 19:50:43,367 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3602 transitions. Word has length 69 [2021-12-06 19:50:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:43,367 INFO L470 AbstractCegarLoop]: Abstraction has 2531 states and 3602 transitions. [2021-12-06 19:50:43,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3602 transitions. [2021-12-06 19:50:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:43,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:43,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:43,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 19:50:43,370 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2024458369, now seen corresponding path program 1 times [2021-12-06 19:50:43,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:43,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980101051] [2021-12-06 19:50:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:43,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:43,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:43,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980101051] [2021-12-06 19:50:43,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980101051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:43,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:50:43,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 19:50:43,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898302185] [2021-12-06 19:50:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:43,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 19:50:43,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:43,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 19:50:43,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:50:43,417 INFO L87 Difference]: Start difference. First operand 2531 states and 3602 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:43,914 INFO L93 Difference]: Finished difference Result 5859 states and 8498 transitions. [2021-12-06 19:50:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:50:43,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-06 19:50:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:43,936 INFO L225 Difference]: With dead ends: 5859 [2021-12-06 19:50:43,937 INFO L226 Difference]: Without dead ends: 4036 [2021-12-06 19:50:43,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-06 19:50:43,943 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 684 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:43,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 1018 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:50:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2021-12-06 19:50:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3460. [2021-12-06 19:50:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 2940 states have (on average 1.4068027210884353) internal successors, (4136), 2985 states have internal predecessors, (4136), 306 states have call successors, (306), 184 states have call predecessors, (306), 212 states have return successors, (455), 306 states have call predecessors, (455), 302 states have call successors, (455) [2021-12-06 19:50:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 4897 transitions. [2021-12-06 19:50:44,130 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 4897 transitions. Word has length 69 [2021-12-06 19:50:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:44,130 INFO L470 AbstractCegarLoop]: Abstraction has 3460 states and 4897 transitions. [2021-12-06 19:50:44,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 19:50:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 4897 transitions. [2021-12-06 19:50:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 19:50:44,133 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:44,133 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:44,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 19:50:44,133 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:44,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash 688510564, now seen corresponding path program 1 times [2021-12-06 19:50:44,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:44,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570543086] [2021-12-06 19:50:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:44,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:50:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:50:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 19:50:44,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:44,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570543086] [2021-12-06 19:50:44,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570543086] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:44,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089707582] [2021-12-06 19:50:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:44,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:44,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:44,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:44,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:50:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:50:44,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:50:44,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:44,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089707582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:44,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:44,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 19:50:44,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396460864] [2021-12-06 19:50:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:44,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:44,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:44,333 INFO L87 Difference]: Start difference. First operand 3460 states and 4897 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:50:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:44,442 INFO L93 Difference]: Finished difference Result 4003 states and 5620 transitions. [2021-12-06 19:50:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:44,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2021-12-06 19:50:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:44,457 INFO L225 Difference]: With dead ends: 4003 [2021-12-06 19:50:44,457 INFO L226 Difference]: Without dead ends: 3458 [2021-12-06 19:50:44,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:44,460 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 72 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:44,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 600 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2021-12-06 19:50:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3414. [2021-12-06 19:50:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3414 states, 2900 states have (on average 1.4037931034482758) internal successors, (4071), 2945 states have internal predecessors, (4071), 302 states have call successors, (302), 182 states have call predecessors, (302), 210 states have return successors, (449), 302 states have call predecessors, (449), 298 states have call successors, (449) [2021-12-06 19:50:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 4822 transitions. [2021-12-06 19:50:44,595 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 4822 transitions. Word has length 68 [2021-12-06 19:50:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:44,596 INFO L470 AbstractCegarLoop]: Abstraction has 3414 states and 4822 transitions. [2021-12-06 19:50:44,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:50:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 4822 transitions. [2021-12-06 19:50:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 19:50:44,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:44,599 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 19:50:44,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:50:44,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 19:50:44,800 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1426484957, now seen corresponding path program 1 times [2021-12-06 19:50:44,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:44,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437026579] [2021-12-06 19:50:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:44,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:50:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:50:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:50:44,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:44,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437026579] [2021-12-06 19:50:44,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437026579] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:44,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486453066] [2021-12-06 19:50:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:44,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:44,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:44,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:44,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:50:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:44,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:50:44,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:45,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:50:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 19:50:45,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486453066] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:45,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:50:45,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2021-12-06 19:50:45,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455133461] [2021-12-06 19:50:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:45,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:50:45,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:50:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:45,128 INFO L87 Difference]: Start difference. First operand 3414 states and 4822 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:50:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:45,303 INFO L93 Difference]: Finished difference Result 3466 states and 4884 transitions. [2021-12-06 19:50:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:50:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2021-12-06 19:50:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:45,321 INFO L225 Difference]: With dead ends: 3466 [2021-12-06 19:50:45,321 INFO L226 Difference]: Without dead ends: 3463 [2021-12-06 19:50:45,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:50:45,323 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 493 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:45,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 376 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:50:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2021-12-06 19:50:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3413. [2021-12-06 19:50:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 2900 states have (on average 1.403103448275862) internal successors, (4069), 2944 states have internal predecessors, (4069), 301 states have call successors, (301), 182 states have call predecessors, (301), 210 states have return successors, (449), 302 states have call predecessors, (449), 298 states have call successors, (449) [2021-12-06 19:50:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 4819 transitions. [2021-12-06 19:50:45,466 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 4819 transitions. Word has length 68 [2021-12-06 19:50:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:45,467 INFO L470 AbstractCegarLoop]: Abstraction has 3413 states and 4819 transitions. [2021-12-06 19:50:45,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 19:50:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 4819 transitions. [2021-12-06 19:50:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 19:50:45,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:45,470 INFO L514 BasicCegarLoop]: trace histogram [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 19:50:45,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-06 19:50:45,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:45,671 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1272047869, now seen corresponding path program 1 times [2021-12-06 19:50:45,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:45,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870015600] [2021-12-06 19:50:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:45,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:50:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-06 19:50:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 19:50:45,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870015600] [2021-12-06 19:50:45,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870015600] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033724317] [2021-12-06 19:50:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:45,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:45,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:45,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:45,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:50:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:45,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:50:45,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 19:50:45,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:50:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 19:50:46,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033724317] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:50:46,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:50:46,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2021-12-06 19:50:46,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451456076] [2021-12-06 19:50:46,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:50:46,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 19:50:46,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 19:50:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:50:46,046 INFO L87 Difference]: Start difference. First operand 3413 states and 4819 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-06 19:50:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:46,709 INFO L93 Difference]: Finished difference Result 4923 states and 6757 transitions. [2021-12-06 19:50:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-06 19:50:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2021-12-06 19:50:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:46,725 INFO L225 Difference]: With dead ends: 4923 [2021-12-06 19:50:46,725 INFO L226 Difference]: Without dead ends: 4427 [2021-12-06 19:50:46,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2021-12-06 19:50:46,728 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 704 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:46,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 2372 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:50:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2021-12-06 19:50:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 3792. [2021-12-06 19:50:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3240 states have (on average 1.3830246913580246) internal successors, (4481), 3292 states have internal predecessors, (4481), 321 states have call successors, (321), 196 states have call predecessors, (321), 229 states have return successors, (483), 319 states have call predecessors, (483), 318 states have call successors, (483) [2021-12-06 19:50:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 5285 transitions. [2021-12-06 19:50:46,918 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 5285 transitions. Word has length 69 [2021-12-06 19:50:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:46,918 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 5285 transitions. [2021-12-06 19:50:46,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-06 19:50:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 5285 transitions. [2021-12-06 19:50:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-06 19:50:46,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:46,923 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 19:50:46,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:50:47,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:47,131 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash -290000336, now seen corresponding path program 1 times [2021-12-06 19:50:47,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:47,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232993352] [2021-12-06 19:50:47,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:47,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:50:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:50:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 19:50:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 19:50:47,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:47,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232993352] [2021-12-06 19:50:47,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232993352] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:47,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132573020] [2021-12-06 19:50:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:47,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:47,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:47,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:47,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:50:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:50:47,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 19:50:47,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:47,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132573020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:47,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:47,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 19:50:47,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122927723] [2021-12-06 19:50:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:47,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:47,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:47,358 INFO L87 Difference]: Start difference. First operand 3792 states and 5285 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:50:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:47,521 INFO L93 Difference]: Finished difference Result 4483 states and 6160 transitions. [2021-12-06 19:50:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:47,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2021-12-06 19:50:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:47,532 INFO L225 Difference]: With dead ends: 4483 [2021-12-06 19:50:47,532 INFO L226 Difference]: Without dead ends: 3714 [2021-12-06 19:50:47,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:47,535 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 247 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:47,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 391 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2021-12-06 19:50:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3705. [2021-12-06 19:50:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 3163 states have (on average 1.3838128359152704) internal successors, (4377), 3214 states have internal predecessors, (4377), 317 states have call successors, (317), 192 states have call predecessors, (317), 223 states have return successors, (475), 314 states have call predecessors, (475), 314 states have call successors, (475) [2021-12-06 19:50:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5169 transitions. [2021-12-06 19:50:47,694 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5169 transitions. Word has length 88 [2021-12-06 19:50:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:47,694 INFO L470 AbstractCegarLoop]: Abstraction has 3705 states and 5169 transitions. [2021-12-06 19:50:47,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 19:50:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5169 transitions. [2021-12-06 19:50:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-06 19:50:47,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:47,700 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:47,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 19:50:47,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 19:50:47,901 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1575033221, now seen corresponding path program 1 times [2021-12-06 19:50:47,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:47,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665636271] [2021-12-06 19:50:47,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:47,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 19:50:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:50:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-06 19:50:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-06 19:50:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 19:50:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-06 19:50:47,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:47,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665636271] [2021-12-06 19:50:47,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665636271] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:47,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493963455] [2021-12-06 19:50:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:47,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:47,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:47,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:50:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:50:48,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:50:48,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:48,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493963455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:48,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:48,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-06 19:50:48,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463036368] [2021-12-06 19:50:48,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:48,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:48,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:48,092 INFO L87 Difference]: Start difference. First operand 3705 states and 5169 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 19:50:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:48,236 INFO L93 Difference]: Finished difference Result 4082 states and 5630 transitions. [2021-12-06 19:50:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2021-12-06 19:50:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:48,245 INFO L225 Difference]: With dead ends: 4082 [2021-12-06 19:50:48,246 INFO L226 Difference]: Without dead ends: 2764 [2021-12-06 19:50:48,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:50:48,249 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 61 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:48,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 595 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2021-12-06 19:50:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2021-12-06 19:50:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2325 states have (on average 1.4417204301075268) internal successors, (3352), 2360 states have internal predecessors, (3352), 260 states have call successors, (260), 155 states have call predecessors, (260), 178 states have return successors, (383), 264 states have call predecessors, (383), 258 states have call successors, (383) [2021-12-06 19:50:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3995 transitions. [2021-12-06 19:50:48,371 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3995 transitions. Word has length 103 [2021-12-06 19:50:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:48,371 INFO L470 AbstractCegarLoop]: Abstraction has 2764 states and 3995 transitions. [2021-12-06 19:50:48,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-06 19:50:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3995 transitions. [2021-12-06 19:50:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-06 19:50:48,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:48,375 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:48,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:50:48,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 19:50:48,577 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1375832156, now seen corresponding path program 1 times [2021-12-06 19:50:48,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:48,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820158325] [2021-12-06 19:50:48,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:48,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:50:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 19:50:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 19:50:48,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:48,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820158325] [2021-12-06 19:50:48,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820158325] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:48,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703625183] [2021-12-06 19:50:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:48,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:48,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:48,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:48,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:50:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:48,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:50:48,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 19:50:48,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:48,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703625183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:48,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:48,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 19:50:48,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403947817] [2021-12-06 19:50:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:48,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:48,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:48,892 INFO L87 Difference]: Start difference. First operand 2764 states and 3995 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 19:50:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:49,071 INFO L93 Difference]: Finished difference Result 8167 states and 11875 transitions. [2021-12-06 19:50:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:49,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 111 [2021-12-06 19:50:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:49,083 INFO L225 Difference]: With dead ends: 8167 [2021-12-06 19:50:49,084 INFO L226 Difference]: Without dead ends: 5415 [2021-12-06 19:50:49,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:49,091 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 152 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:49,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 374 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2021-12-06 19:50:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5359. [2021-12-06 19:50:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5359 states, 4506 states have (on average 1.4378606302707502) internal successors, (6479), 4574 states have internal predecessors, (6479), 498 states have call successors, (498), 307 states have call predecessors, (498), 354 states have return successors, (731), 493 states have call predecessors, (731), 496 states have call successors, (731) [2021-12-06 19:50:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 7708 transitions. [2021-12-06 19:50:49,303 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 7708 transitions. Word has length 111 [2021-12-06 19:50:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:49,303 INFO L470 AbstractCegarLoop]: Abstraction has 5359 states and 7708 transitions. [2021-12-06 19:50:49,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 19:50:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 7708 transitions. [2021-12-06 19:50:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-06 19:50:49,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:49,310 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:49,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:50:49,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 19:50:49,511 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 483275324, now seen corresponding path program 1 times [2021-12-06 19:50:49,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:49,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696535664] [2021-12-06 19:50:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:49,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:50:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 19:50:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 19:50:49,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696535664] [2021-12-06 19:50:49,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696535664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067031378] [2021-12-06 19:50:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:49,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:49,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:49,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:49,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:50:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:49,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:50:49,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:50:49,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:49,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067031378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:49,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:49,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:50:49,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581616022] [2021-12-06 19:50:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:49,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:49,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:49,723 INFO L87 Difference]: Start difference. First operand 5359 states and 7708 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:50:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:50,091 INFO L93 Difference]: Finished difference Result 15659 states and 22758 transitions. [2021-12-06 19:50:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2021-12-06 19:50:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:50,122 INFO L225 Difference]: With dead ends: 15659 [2021-12-06 19:50:50,122 INFO L226 Difference]: Without dead ends: 10313 [2021-12-06 19:50:50,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:50,133 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 153 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:50,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 544 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10313 states. [2021-12-06 19:50:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10313 to 10313. [2021-12-06 19:50:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10313 states, 8671 states have (on average 1.4224426248414255) internal successors, (12334), 8788 states have internal predecessors, (12334), 945 states have call successors, (945), 601 states have call predecessors, (945), 696 states have return successors, (1546), 955 states have call predecessors, (1546), 943 states have call successors, (1546) [2021-12-06 19:50:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10313 states to 10313 states and 14825 transitions. [2021-12-06 19:50:50,548 INFO L78 Accepts]: Start accepts. Automaton has 10313 states and 14825 transitions. Word has length 111 [2021-12-06 19:50:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:50,548 INFO L470 AbstractCegarLoop]: Abstraction has 10313 states and 14825 transitions. [2021-12-06 19:50:50,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:50:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10313 states and 14825 transitions. [2021-12-06 19:50:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-06 19:50:50,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:50,566 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:50,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 19:50:50,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:50,767 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 142639029, now seen corresponding path program 1 times [2021-12-06 19:50:50,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747791947] [2021-12-06 19:50:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:50,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:50:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 19:50:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 19:50:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-06 19:50:50,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:50,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747791947] [2021-12-06 19:50:50,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747791947] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:50,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233049039] [2021-12-06 19:50:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:50,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:50,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:50,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:50,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:50:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:50,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:50:50,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:50:51,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:51,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233049039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:51,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:51,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 19:50:51,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793574928] [2021-12-06 19:50:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:51,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:51,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:51,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:51,085 INFO L87 Difference]: Start difference. First operand 10313 states and 14825 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 19:50:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:51,805 INFO L93 Difference]: Finished difference Result 30449 states and 44040 transitions. [2021-12-06 19:50:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:51,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2021-12-06 19:50:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:51,863 INFO L225 Difference]: With dead ends: 30449 [2021-12-06 19:50:51,863 INFO L226 Difference]: Without dead ends: 20153 [2021-12-06 19:50:51,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:51,888 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 110 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:51,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20153 states. [2021-12-06 19:50:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20153 to 19941. [2021-12-06 19:50:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19941 states, 16775 states have (on average 1.4178241430700447) internal successors, (23784), 17006 states have internal predecessors, (23784), 1799 states have call successors, (1799), 1175 states have call predecessors, (1799), 1366 states have return successors, (2924), 1791 states have call predecessors, (2924), 1797 states have call successors, (2924) [2021-12-06 19:50:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19941 states to 19941 states and 28507 transitions. [2021-12-06 19:50:52,745 INFO L78 Accepts]: Start accepts. Automaton has 19941 states and 28507 transitions. Word has length 143 [2021-12-06 19:50:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:52,745 INFO L470 AbstractCegarLoop]: Abstraction has 19941 states and 28507 transitions. [2021-12-06 19:50:52,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 19:50:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 19941 states and 28507 transitions. [2021-12-06 19:50:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-06 19:50:52,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:52,787 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:52,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 19:50:52,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:52,988 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash 28732006, now seen corresponding path program 1 times [2021-12-06 19:50:52,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:52,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701446901] [2021-12-06 19:50:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:52,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 19:50:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:50:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 19:50:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 19:50:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-06 19:50:53,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:53,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701446901] [2021-12-06 19:50:53,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701446901] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:53,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423210949] [2021-12-06 19:50:53,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:53,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:53,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:53,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:53,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:50:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:53,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:50:53,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:50:53,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:53,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423210949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:53,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:53,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:50:53,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294294028] [2021-12-06 19:50:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:53,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:53,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:53,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:53,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:53,261 INFO L87 Difference]: Start difference. First operand 19941 states and 28507 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:50:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:53,966 INFO L93 Difference]: Finished difference Result 31717 states and 45615 transitions. [2021-12-06 19:50:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:53,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2021-12-06 19:50:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:54,005 INFO L225 Difference]: With dead ends: 31717 [2021-12-06 19:50:54,005 INFO L226 Difference]: Without dead ends: 17567 [2021-12-06 19:50:54,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:54,028 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 129 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 225 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 19:50:54,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17567 states. [2021-12-06 19:50:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17567 to 12887. [2021-12-06 19:50:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12887 states, 10889 states have (on average 1.3683533841491413) internal successors, (14900), 11010 states have internal predecessors, (14900), 1123 states have call successors, (1123), 779 states have call predecessors, (1123), 874 states have return successors, (1584), 1113 states have call predecessors, (1584), 1121 states have call successors, (1584) [2021-12-06 19:50:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12887 states to 12887 states and 17607 transitions. [2021-12-06 19:50:54,646 INFO L78 Accepts]: Start accepts. Automaton has 12887 states and 17607 transitions. Word has length 160 [2021-12-06 19:50:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:54,646 INFO L470 AbstractCegarLoop]: Abstraction has 12887 states and 17607 transitions. [2021-12-06 19:50:54,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:50:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12887 states and 17607 transitions. [2021-12-06 19:50:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-06 19:50:54,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:54,658 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, 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 19:50:54,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:50:54,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:54,859 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash -124896125, now seen corresponding path program 1 times [2021-12-06 19:50:54,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:54,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982059771] [2021-12-06 19:50:54,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:54,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 19:50:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:50:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 19:50:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 19:50:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-06 19:50:54,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:54,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982059771] [2021-12-06 19:50:54,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982059771] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:54,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631864647] [2021-12-06 19:50:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:54,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:54,941 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:54,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:50:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:55,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:50:55,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 19:50:55,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:55,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631864647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:55,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:55,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:50:55,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265849766] [2021-12-06 19:50:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:55,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:55,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:55,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:55,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:55,127 INFO L87 Difference]: Start difference. First operand 12887 states and 17607 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:50:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:55,849 INFO L93 Difference]: Finished difference Result 22814 states and 31149 transitions. [2021-12-06 19:50:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:55,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 160 [2021-12-06 19:50:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:55,887 INFO L225 Difference]: With dead ends: 22814 [2021-12-06 19:50:55,888 INFO L226 Difference]: Without dead ends: 13835 [2021-12-06 19:50:55,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:55,904 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 130 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:55,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 390 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2021-12-06 19:50:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 13753. [2021-12-06 19:50:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13753 states, 11683 states have (on average 1.3431481639989729) internal successors, (15692), 11804 states have internal predecessors, (15692), 1137 states have call successors, (1137), 837 states have call predecessors, (1137), 932 states have return successors, (1656), 1127 states have call predecessors, (1656), 1135 states have call successors, (1656) [2021-12-06 19:50:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13753 states to 13753 states and 18485 transitions. [2021-12-06 19:50:56,566 INFO L78 Accepts]: Start accepts. Automaton has 13753 states and 18485 transitions. Word has length 160 [2021-12-06 19:50:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:56,566 INFO L470 AbstractCegarLoop]: Abstraction has 13753 states and 18485 transitions. [2021-12-06 19:50:56,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:50:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13753 states and 18485 transitions. [2021-12-06 19:50:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:50:56,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:56,578 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:56,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 19:50:56,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:56,779 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash -402645848, now seen corresponding path program 1 times [2021-12-06 19:50:56,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:56,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996955247] [2021-12-06 19:50:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:56,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:50:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:50:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:50:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:50:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-06 19:50:56,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:56,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996955247] [2021-12-06 19:50:56,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996955247] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:56,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332193683] [2021-12-06 19:50:56,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:56,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:56,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:56,854 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:56,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:50:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:56,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:50:56,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 19:50:57,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:50:57,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332193683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:50:57,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:50:57,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:50:57,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152545424] [2021-12-06 19:50:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:50:57,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:50:57,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:57,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:50:57,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:57,006 INFO L87 Difference]: Start difference. First operand 13753 states and 18485 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:50:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:58,105 INFO L93 Difference]: Finished difference Result 40503 states and 54983 transitions. [2021-12-06 19:50:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:50:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-06 19:50:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:58,158 INFO L225 Difference]: With dead ends: 40503 [2021-12-06 19:50:58,158 INFO L226 Difference]: Without dead ends: 26769 [2021-12-06 19:50:58,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:50:58,174 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 162 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:58,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 550 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:50:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26769 states. [2021-12-06 19:50:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26769 to 26737. [2021-12-06 19:50:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26737 states, 22709 states have (on average 1.3318067726452067) internal successors, (30244), 22950 states have internal predecessors, (30244), 2199 states have call successors, (2199), 1637 states have call predecessors, (2199), 1828 states have return successors, (3710), 2181 states have call predecessors, (3710), 2197 states have call successors, (3710) [2021-12-06 19:50:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26737 states to 26737 states and 36153 transitions. [2021-12-06 19:50:59,649 INFO L78 Accepts]: Start accepts. Automaton has 26737 states and 36153 transitions. Word has length 161 [2021-12-06 19:50:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:59,649 INFO L470 AbstractCegarLoop]: Abstraction has 26737 states and 36153 transitions. [2021-12-06 19:50:59,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:50:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 26737 states and 36153 transitions. [2021-12-06 19:50:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:50:59,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:59,676 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:59,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 19:50:59,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:59,877 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1546394152, now seen corresponding path program 1 times [2021-12-06 19:50:59,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792223036] [2021-12-06 19:50:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:59,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:50:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:50:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:50:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:50:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:50:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:50:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:50:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:50:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:50:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:50:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:50:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 19:50:59,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792223036] [2021-12-06 19:50:59,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792223036] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:50:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025868377] [2021-12-06 19:50:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:59,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:59,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:59,948 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:59,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 19:51:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:00,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:51:00,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-06 19:51:00,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:00,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025868377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:00,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:00,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:00,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506176104] [2021-12-06 19:51:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:00,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:00,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:00,137 INFO L87 Difference]: Start difference. First operand 26737 states and 36153 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:51:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:01,199 INFO L93 Difference]: Finished difference Result 45731 states and 63030 transitions. [2021-12-06 19:51:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 161 [2021-12-06 19:51:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:01,245 INFO L225 Difference]: With dead ends: 45731 [2021-12-06 19:51:01,245 INFO L226 Difference]: Without dead ends: 23467 [2021-12-06 19:51:01,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:01,276 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 124 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 223 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 19:51:01,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 223 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23467 states. [2021-12-06 19:51:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23467 to 17919. [2021-12-06 19:51:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17919 states, 15279 states have (on average 1.2941946462464822) internal successors, (19774), 15410 states have internal predecessors, (19774), 1447 states have call successors, (1447), 1097 states have call predecessors, (1447), 1192 states have return successors, (2250), 1427 states have call predecessors, (2250), 1445 states have call successors, (2250) [2021-12-06 19:51:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17919 states to 17919 states and 23471 transitions. [2021-12-06 19:51:02,300 INFO L78 Accepts]: Start accepts. Automaton has 17919 states and 23471 transitions. Word has length 161 [2021-12-06 19:51:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:02,300 INFO L470 AbstractCegarLoop]: Abstraction has 17919 states and 23471 transitions. [2021-12-06 19:51:02,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:51:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 17919 states and 23471 transitions. [2021-12-06 19:51:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:51:02,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:02,313 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:02,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 19:51:02,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 19:51:02,515 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1993102869, now seen corresponding path program 1 times [2021-12-06 19:51:02,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:02,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363829242] [2021-12-06 19:51:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:02,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 19:51:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:51:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:51:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-06 19:51:02,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:02,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363829242] [2021-12-06 19:51:02,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363829242] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:02,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822490116] [2021-12-06 19:51:02,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:02,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:02,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:02,609 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:02,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 19:51:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:02,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:51:02,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 19:51:02,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:02,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822490116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:02,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:02,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:02,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341880396] [2021-12-06 19:51:02,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:02,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:02,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:02,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:02,761 INFO L87 Difference]: Start difference. First operand 17919 states and 23471 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:51:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:04,245 INFO L93 Difference]: Finished difference Result 51055 states and 67739 transitions. [2021-12-06 19:51:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:04,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-06 19:51:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:04,314 INFO L225 Difference]: With dead ends: 51055 [2021-12-06 19:51:04,314 INFO L226 Difference]: Without dead ends: 33165 [2021-12-06 19:51:04,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:04,344 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 149 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:04,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 541 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33165 states. [2021-12-06 19:51:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33165 to 33161. [2021-12-06 19:51:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33161 states, 28173 states have (on average 1.28321442515884) internal successors, (36152), 28434 states have internal predecessors, (36152), 2747 states have call successors, (2747), 2049 states have call predecessors, (2747), 2240 states have return successors, (4976), 2709 states have call predecessors, (4976), 2745 states have call successors, (4976) [2021-12-06 19:51:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33161 states to 33161 states and 43875 transitions. [2021-12-06 19:51:06,410 INFO L78 Accepts]: Start accepts. Automaton has 33161 states and 43875 transitions. Word has length 161 [2021-12-06 19:51:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:06,410 INFO L470 AbstractCegarLoop]: Abstraction has 33161 states and 43875 transitions. [2021-12-06 19:51:06,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:51:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 33161 states and 43875 transitions. [2021-12-06 19:51:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:51:06,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:06,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:06,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 19:51:06,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 19:51:06,629 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash -129116033, now seen corresponding path program 1 times [2021-12-06 19:51:06,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:06,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990483824] [2021-12-06 19:51:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:06,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:51:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:51:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:51:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:51:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-06 19:51:06,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:06,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990483824] [2021-12-06 19:51:06,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990483824] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:06,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050382963] [2021-12-06 19:51:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:06,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:06,733 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:06,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 19:51:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:06,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:51:06,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 19:51:06,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:06,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050382963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:06,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:06,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:06,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821668792] [2021-12-06 19:51:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:06,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:06,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:06,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:06,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:06,899 INFO L87 Difference]: Start difference. First operand 33161 states and 43875 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:51:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:08,463 INFO L93 Difference]: Finished difference Result 58809 states and 77933 transitions. [2021-12-06 19:51:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2021-12-06 19:51:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:08,528 INFO L225 Difference]: With dead ends: 58809 [2021-12-06 19:51:08,528 INFO L226 Difference]: Without dead ends: 33669 [2021-12-06 19:51:08,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:08,554 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 150 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:08,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 398 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33669 states. [2021-12-06 19:51:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33669 to 33161. [2021-12-06 19:51:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33161 states, 28173 states have (on average 1.275121570297803) internal successors, (35924), 28434 states have internal predecessors, (35924), 2747 states have call successors, (2747), 2049 states have call predecessors, (2747), 2240 states have return successors, (4976), 2709 states have call predecessors, (4976), 2745 states have call successors, (4976) [2021-12-06 19:51:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33161 states to 33161 states and 43647 transitions. [2021-12-06 19:51:10,299 INFO L78 Accepts]: Start accepts. Automaton has 33161 states and 43647 transitions. Word has length 161 [2021-12-06 19:51:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:10,299 INFO L470 AbstractCegarLoop]: Abstraction has 33161 states and 43647 transitions. [2021-12-06 19:51:10,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:51:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 33161 states and 43647 transitions. [2021-12-06 19:51:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:51:10,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:10,317 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:10,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 19:51:10,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 19:51:10,518 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1698954724, now seen corresponding path program 1 times [2021-12-06 19:51:10,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993431778] [2021-12-06 19:51:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:10,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:51:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:51:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:51:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-06 19:51:10,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993431778] [2021-12-06 19:51:10,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993431778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:10,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150615783] [2021-12-06 19:51:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:10,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:10,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:10,602 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:10,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 19:51:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:10,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:51:10,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-06 19:51:10,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:10,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150615783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:10,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:10,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:10,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135891180] [2021-12-06 19:51:10,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:10,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:10,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:10,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:10,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:10,782 INFO L87 Difference]: Start difference. First operand 33161 states and 43647 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:51:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:12,513 INFO L93 Difference]: Finished difference Result 59197 states and 78129 transitions. [2021-12-06 19:51:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2021-12-06 19:51:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:12,589 INFO L225 Difference]: With dead ends: 59197 [2021-12-06 19:51:12,589 INFO L226 Difference]: Without dead ends: 34057 [2021-12-06 19:51:12,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:12,624 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 149 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:12,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 414 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34057 states. [2021-12-06 19:51:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34057 to 33085. [2021-12-06 19:51:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33085 states, 28097 states have (on average 1.2677510054454213) internal successors, (35620), 28358 states have internal predecessors, (35620), 2747 states have call successors, (2747), 2049 states have call predecessors, (2747), 2240 states have return successors, (4976), 2709 states have call predecessors, (4976), 2745 states have call successors, (4976) [2021-12-06 19:51:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33085 states to 33085 states and 43343 transitions. [2021-12-06 19:51:14,556 INFO L78 Accepts]: Start accepts. Automaton has 33085 states and 43343 transitions. Word has length 161 [2021-12-06 19:51:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:14,556 INFO L470 AbstractCegarLoop]: Abstraction has 33085 states and 43343 transitions. [2021-12-06 19:51:14,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 19:51:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 33085 states and 43343 transitions. [2021-12-06 19:51:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:51:14,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:14,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:14,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-06 19:51:14,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 19:51:14,775 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 590012799, now seen corresponding path program 1 times [2021-12-06 19:51:14,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:14,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268961847] [2021-12-06 19:51:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:14,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:51:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:51:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:51:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:51:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-06 19:51:14,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:14,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268961847] [2021-12-06 19:51:14,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268961847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:14,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:51:14,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:51:14,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276232410] [2021-12-06 19:51:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:14,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:51:14,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:51:14,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:51:14,856 INFO L87 Difference]: Start difference. First operand 33085 states and 43343 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:51:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:16,557 INFO L93 Difference]: Finished difference Result 64425 states and 83676 transitions. [2021-12-06 19:51:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:51:16,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-06 19:51:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:16,626 INFO L225 Difference]: With dead ends: 64425 [2021-12-06 19:51:16,626 INFO L226 Difference]: Without dead ends: 31365 [2021-12-06 19:51:16,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:16,675 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 294 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:16,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 345 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:51:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31365 states. [2021-12-06 19:51:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31365 to 29221. [2021-12-06 19:51:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29221 states, 24999 states have (on average 1.268290731629265) internal successors, (31706), 25524 states have internal predecessors, (31706), 2055 states have call successors, (2055), 1545 states have call predecessors, (2055), 2166 states have return successors, (4043), 2167 states have call predecessors, (4043), 2053 states have call successors, (4043) [2021-12-06 19:51:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29221 states to 29221 states and 37804 transitions. [2021-12-06 19:51:18,398 INFO L78 Accepts]: Start accepts. Automaton has 29221 states and 37804 transitions. Word has length 161 [2021-12-06 19:51:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:18,398 INFO L470 AbstractCegarLoop]: Abstraction has 29221 states and 37804 transitions. [2021-12-06 19:51:18,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:51:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29221 states and 37804 transitions. [2021-12-06 19:51:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 19:51:18,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:18,412 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:18,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 19:51:18,412 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash -806789094, now seen corresponding path program 1 times [2021-12-06 19:51:18,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:18,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624164043] [2021-12-06 19:51:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:18,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 19:51:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 19:51:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:51:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-06 19:51:18,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:18,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624164043] [2021-12-06 19:51:18,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624164043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:18,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:51:18,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:51:18,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718615082] [2021-12-06 19:51:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:18,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:51:18,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:18,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:51:18,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:51:18,456 INFO L87 Difference]: Start difference. First operand 29221 states and 37804 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:51:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:19,892 INFO L93 Difference]: Finished difference Result 53125 states and 68555 transitions. [2021-12-06 19:51:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:51:19,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-06 19:51:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:19,932 INFO L225 Difference]: With dead ends: 53125 [2021-12-06 19:51:19,933 INFO L226 Difference]: Without dead ends: 23921 [2021-12-06 19:51:19,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:19,962 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 294 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:19,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 343 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:51:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23921 states. [2021-12-06 19:51:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23921 to 21923. [2021-12-06 19:51:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21923 states, 18799 states have (on average 1.277940315974254) internal successors, (24024), 19170 states have internal predecessors, (24024), 1529 states have call successors, (1529), 1157 states have call predecessors, (1529), 1594 states have return successors, (2833), 1603 states have call predecessors, (2833), 1527 states have call successors, (2833) [2021-12-06 19:51:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21923 states to 21923 states and 28386 transitions. [2021-12-06 19:51:21,240 INFO L78 Accepts]: Start accepts. Automaton has 21923 states and 28386 transitions. Word has length 161 [2021-12-06 19:51:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:21,240 INFO L470 AbstractCegarLoop]: Abstraction has 21923 states and 28386 transitions. [2021-12-06 19:51:21,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 19:51:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21923 states and 28386 transitions. [2021-12-06 19:51:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:51:21,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:21,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:21,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 19:51:21,251 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash -994779915, now seen corresponding path program 1 times [2021-12-06 19:51:21,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:21,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601304576] [2021-12-06 19:51:21,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:21,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 19:51:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 19:51:21,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:21,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601304576] [2021-12-06 19:51:21,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601304576] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:21,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072174586] [2021-12-06 19:51:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:21,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:21,313 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:21,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 19:51:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:21,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:51:21,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 19:51:21,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:21,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072174586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:21,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:21,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:21,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015208483] [2021-12-06 19:51:21,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:21,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:21,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:21,480 INFO L87 Difference]: Start difference. First operand 21923 states and 28386 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:51:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:22,683 INFO L93 Difference]: Finished difference Result 36835 states and 49108 transitions. [2021-12-06 19:51:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:22,683 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2021-12-06 19:51:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:22,725 INFO L225 Difference]: With dead ends: 36835 [2021-12-06 19:51:22,725 INFO L226 Difference]: Without dead ends: 22031 [2021-12-06 19:51:22,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:22,753 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 141 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:22,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 462 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22031 states. [2021-12-06 19:51:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22031 to 21923. [2021-12-06 19:51:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21923 states, 18799 states have (on average 1.2552795361455396) internal successors, (23598), 19170 states have internal predecessors, (23598), 1529 states have call successors, (1529), 1157 states have call predecessors, (1529), 1594 states have return successors, (2833), 1603 states have call predecessors, (2833), 1527 states have call successors, (2833) [2021-12-06 19:51:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21923 states to 21923 states and 27960 transitions. [2021-12-06 19:51:24,068 INFO L78 Accepts]: Start accepts. Automaton has 21923 states and 27960 transitions. Word has length 163 [2021-12-06 19:51:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:24,068 INFO L470 AbstractCegarLoop]: Abstraction has 21923 states and 27960 transitions. [2021-12-06 19:51:24,068 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:51:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 21923 states and 27960 transitions. [2021-12-06 19:51:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:51:24,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:24,078 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:24,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-06 19:51:24,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:24,279 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash 337114389, now seen corresponding path program 1 times [2021-12-06 19:51:24,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:24,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351230268] [2021-12-06 19:51:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:24,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 19:51:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 19:51:24,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:24,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351230268] [2021-12-06 19:51:24,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351230268] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:24,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194281479] [2021-12-06 19:51:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:24,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:24,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:24,374 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:24,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 19:51:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:24,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 19:51:24,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-06 19:51:24,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:24,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194281479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:24,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:24,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:24,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205152179] [2021-12-06 19:51:24,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:24,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:24,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:24,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:24,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:24,544 INFO L87 Difference]: Start difference. First operand 21923 states and 27960 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:51:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:25,656 INFO L93 Difference]: Finished difference Result 40455 states and 52687 transitions. [2021-12-06 19:51:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2021-12-06 19:51:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:25,693 INFO L225 Difference]: With dead ends: 40455 [2021-12-06 19:51:25,693 INFO L226 Difference]: Without dead ends: 19761 [2021-12-06 19:51:25,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:25,724 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 164 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:25,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 221 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19761 states. [2021-12-06 19:51:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19761 to 18955. [2021-12-06 19:51:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18955 states, 16308 states have (on average 1.2211184694628403) internal successors, (19914), 16612 states have internal predecessors, (19914), 1301 states have call successors, (1301), 985 states have call predecessors, (1301), 1345 states have return successors, (2273), 1361 states have call predecessors, (2273), 1299 states have call successors, (2273) [2021-12-06 19:51:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18955 states to 18955 states and 23488 transitions. [2021-12-06 19:51:26,892 INFO L78 Accepts]: Start accepts. Automaton has 18955 states and 23488 transitions. Word has length 163 [2021-12-06 19:51:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:26,893 INFO L470 AbstractCegarLoop]: Abstraction has 18955 states and 23488 transitions. [2021-12-06 19:51:26,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:51:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 23488 transitions. [2021-12-06 19:51:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 19:51:26,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:26,900 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:26,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 19:51:27,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-06 19:51:27,101 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1269839222, now seen corresponding path program 1 times [2021-12-06 19:51:27,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:27,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293535476] [2021-12-06 19:51:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:27,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 19:51:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 19:51:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 19:51:27,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:27,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293535476] [2021-12-06 19:51:27,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293535476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:27,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271175004] [2021-12-06 19:51:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:27,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:27,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:27,191 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:27,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 19:51:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:27,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:51:27,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:51:27,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:27,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271175004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:27,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:27,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:27,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197476396] [2021-12-06 19:51:27,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:27,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:27,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:27,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:27,352 INFO L87 Difference]: Start difference. First operand 18955 states and 23488 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:51:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:28,415 INFO L93 Difference]: Finished difference Result 32067 states and 40870 transitions. [2021-12-06 19:51:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2021-12-06 19:51:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:28,448 INFO L225 Difference]: With dead ends: 32067 [2021-12-06 19:51:28,448 INFO L226 Difference]: Without dead ends: 19047 [2021-12-06 19:51:28,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:28,470 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 134 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:28,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19047 states. [2021-12-06 19:51:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19047 to 18955. [2021-12-06 19:51:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18955 states, 16308 states have (on average 1.1947510424331615) internal successors, (19484), 16612 states have internal predecessors, (19484), 1301 states have call successors, (1301), 985 states have call predecessors, (1301), 1345 states have return successors, (2273), 1361 states have call predecessors, (2273), 1299 states have call successors, (2273) [2021-12-06 19:51:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18955 states to 18955 states and 23058 transitions. [2021-12-06 19:51:29,615 INFO L78 Accepts]: Start accepts. Automaton has 18955 states and 23058 transitions. Word has length 163 [2021-12-06 19:51:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:29,615 INFO L470 AbstractCegarLoop]: Abstraction has 18955 states and 23058 transitions. [2021-12-06 19:51:29,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 19:51:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 23058 transitions. [2021-12-06 19:51:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-06 19:51:29,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:29,622 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:29,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-06 19:51:29,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:29,824 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1732528486, now seen corresponding path program 1 times [2021-12-06 19:51:29,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:29,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155077655] [2021-12-06 19:51:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:29,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-06 19:51:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 19:51:29,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155077655] [2021-12-06 19:51:29,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155077655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551740259] [2021-12-06 19:51:29,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:29,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:29,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:29,906 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:29,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 19:51:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:29,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 19:51:29,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-06 19:51:30,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:30,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551740259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:30,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:30,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 19:51:30,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013982328] [2021-12-06 19:51:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:30,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 19:51:30,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:30,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 19:51:30,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:30,064 INFO L87 Difference]: Start difference. First operand 18955 states and 23058 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:51:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:31,090 INFO L93 Difference]: Finished difference Result 28151 states and 35018 transitions. [2021-12-06 19:51:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 19:51:31,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2021-12-06 19:51:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:31,122 INFO L225 Difference]: With dead ends: 28151 [2021-12-06 19:51:31,122 INFO L226 Difference]: Without dead ends: 18987 [2021-12-06 19:51:31,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:51:31,142 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 155 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:31,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 476 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18987 states. [2021-12-06 19:51:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18987 to 18955. [2021-12-06 19:51:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18955 states, 16308 states have (on average 1.184449350012264) internal successors, (19316), 16612 states have internal predecessors, (19316), 1301 states have call successors, (1301), 985 states have call predecessors, (1301), 1345 states have return successors, (2273), 1361 states have call predecessors, (2273), 1299 states have call successors, (2273) [2021-12-06 19:51:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18955 states to 18955 states and 22890 transitions. [2021-12-06 19:51:32,283 INFO L78 Accepts]: Start accepts. Automaton has 18955 states and 22890 transitions. Word has length 164 [2021-12-06 19:51:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:32,284 INFO L470 AbstractCegarLoop]: Abstraction has 18955 states and 22890 transitions. [2021-12-06 19:51:32,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 19:51:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 22890 transitions. [2021-12-06 19:51:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:51:32,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:32,290 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:32,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-06 19:51:32,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-06 19:51:32,492 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash 117096205, now seen corresponding path program 1 times [2021-12-06 19:51:32,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:32,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188230230] [2021-12-06 19:51:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:32,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:51:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 19:51:32,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:32,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188230230] [2021-12-06 19:51:32,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188230230] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:32,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931681566] [2021-12-06 19:51:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:32,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:32,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:32,591 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:32,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-06 19:51:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:32,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 19:51:32,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 19:51:32,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:32,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931681566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:32,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:32,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 19:51:32,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324963041] [2021-12-06 19:51:32,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:32,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:51:32,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:51:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:51:32,786 INFO L87 Difference]: Start difference. First operand 18955 states and 22890 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:33,758 INFO L93 Difference]: Finished difference Result 29487 states and 35917 transitions. [2021-12-06 19:51:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:51:33,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-06 19:51:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:33,784 INFO L225 Difference]: With dead ends: 29487 [2021-12-06 19:51:33,785 INFO L226 Difference]: Without dead ends: 15381 [2021-12-06 19:51:33,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:51:33,803 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 186 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:33,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 351 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:51:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15381 states. [2021-12-06 19:51:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15381 to 10667. [2021-12-06 19:51:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10667 states, 9200 states have (on average 1.1680434782608695) internal successors, (10746), 9366 states have internal predecessors, (10746), 731 states have call successors, (731), 539 states have call predecessors, (731), 735 states have return successors, (1289), 763 states have call predecessors, (1289), 729 states have call successors, (1289) [2021-12-06 19:51:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 12766 transitions. [2021-12-06 19:51:34,583 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 12766 transitions. Word has length 165 [2021-12-06 19:51:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:34,584 INFO L470 AbstractCegarLoop]: Abstraction has 10667 states and 12766 transitions. [2021-12-06 19:51:34,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 12766 transitions. [2021-12-06 19:51:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:51:34,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:34,588 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:34,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-06 19:51:34,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-06 19:51:34,789 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash 605143311, now seen corresponding path program 1 times [2021-12-06 19:51:34,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:34,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606174808] [2021-12-06 19:51:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:34,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 19:51:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:51:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 19:51:34,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606174808] [2021-12-06 19:51:34,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606174808] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153989507] [2021-12-06 19:51:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:34,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:34,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:34,856 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:34,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-06 19:51:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:34,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:51:34,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-12-06 19:51:35,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:35,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153989507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:35,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:35,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 19:51:35,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043223577] [2021-12-06 19:51:35,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:35,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:51:35,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:51:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:51:35,030 INFO L87 Difference]: Start difference. First operand 10667 states and 12766 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:35,703 INFO L93 Difference]: Finished difference Result 18019 states and 21801 transitions. [2021-12-06 19:51:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:51:35,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-06 19:51:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:35,716 INFO L225 Difference]: With dead ends: 18019 [2021-12-06 19:51:35,716 INFO L226 Difference]: Without dead ends: 7364 [2021-12-06 19:51:35,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:51:35,728 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 87 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:35,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 740 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7364 states. [2021-12-06 19:51:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7364 to 6960. [2021-12-06 19:51:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6960 states, 5959 states have (on average 1.1485148514851484) internal successors, (6844), 6065 states have internal predecessors, (6844), 501 states have call successors, (501), 374 states have call predecessors, (501), 499 states have return successors, (793), 521 states have call predecessors, (793), 499 states have call successors, (793) [2021-12-06 19:51:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6960 states to 6960 states and 8138 transitions. [2021-12-06 19:51:36,210 INFO L78 Accepts]: Start accepts. Automaton has 6960 states and 8138 transitions. Word has length 165 [2021-12-06 19:51:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:36,210 INFO L470 AbstractCegarLoop]: Abstraction has 6960 states and 8138 transitions. [2021-12-06 19:51:36,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6960 states and 8138 transitions. [2021-12-06 19:51:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:51:36,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:36,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:36,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-06 19:51:36,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-06 19:51:36,414 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1688836692, now seen corresponding path program 1 times [2021-12-06 19:51:36,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:36,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972018944] [2021-12-06 19:51:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:36,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:51:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:51:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 19:51:36,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:36,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972018944] [2021-12-06 19:51:36,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972018944] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:36,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581088498] [2021-12-06 19:51:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:36,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:36,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:36,490 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:36,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-06 19:51:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:36,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:51:36,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 19:51:36,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:36,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581088498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:36,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:36,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 19:51:36,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935232335] [2021-12-06 19:51:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:36,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:51:36,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:51:36,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:51:36,650 INFO L87 Difference]: Start difference. First operand 6960 states and 8138 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:37,071 INFO L93 Difference]: Finished difference Result 12855 states and 15229 transitions. [2021-12-06 19:51:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:51:37,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-06 19:51:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:37,079 INFO L225 Difference]: With dead ends: 12855 [2021-12-06 19:51:37,079 INFO L226 Difference]: Without dead ends: 5907 [2021-12-06 19:51:37,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:51:37,087 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 49 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:37,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 726 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5907 states. [2021-12-06 19:51:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5907 to 5759. [2021-12-06 19:51:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5759 states, 4914 states have (on average 1.131054131054131) internal successors, (5558), 4995 states have internal predecessors, (5558), 428 states have call successors, (428), 316 states have call predecessors, (428), 416 states have return successors, (617), 448 states have call predecessors, (617), 426 states have call successors, (617) [2021-12-06 19:51:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5759 states to 5759 states and 6603 transitions. [2021-12-06 19:51:37,503 INFO L78 Accepts]: Start accepts. Automaton has 5759 states and 6603 transitions. Word has length 165 [2021-12-06 19:51:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:37,503 INFO L470 AbstractCegarLoop]: Abstraction has 5759 states and 6603 transitions. [2021-12-06 19:51:37,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5759 states and 6603 transitions. [2021-12-06 19:51:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-06 19:51:37,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:37,505 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:37,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-12-06 19:51:37,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-06 19:51:37,707 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1857225114, now seen corresponding path program 1 times [2021-12-06 19:51:37,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:37,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723981947] [2021-12-06 19:51:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:37,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:51:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 19:51:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 19:51:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-06 19:51:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-06 19:51:37,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:37,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723981947] [2021-12-06 19:51:37,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723981947] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:51:37,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294995012] [2021-12-06 19:51:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:37,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:51:37,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:51:37,779 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:51:37,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-06 19:51:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:37,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 19:51:37,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:51:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 19:51:37,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:51:37,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294995012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:37,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:51:37,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 19:51:37,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328794408] [2021-12-06 19:51:37,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:37,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:51:37,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:37,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:51:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:51:37,946 INFO L87 Difference]: Start difference. First operand 5759 states and 6603 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:38,159 INFO L93 Difference]: Finished difference Result 8597 states and 9897 transitions. [2021-12-06 19:51:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:51:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-06 19:51:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:38,162 INFO L225 Difference]: With dead ends: 8597 [2021-12-06 19:51:38,162 INFO L226 Difference]: Without dead ends: 1796 [2021-12-06 19:51:38,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:51:38,168 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 10 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:38,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 711 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:51:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2021-12-06 19:51:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1796. [2021-12-06 19:51:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1529 states have (on average 1.104643557880968) internal successors, (1689), 1541 states have internal predecessors, (1689), 153 states have call successors, (153), 106 states have call predecessors, (153), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2021-12-06 19:51:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2001 transitions. [2021-12-06 19:51:38,286 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2001 transitions. Word has length 165 [2021-12-06 19:51:38,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:38,286 INFO L470 AbstractCegarLoop]: Abstraction has 1796 states and 2001 transitions. [2021-12-06 19:51:38,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 19:51:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2001 transitions. [2021-12-06 19:51:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-06 19:51:38,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:38,287 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:38,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-06 19:51:38,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-06 19:51:38,489 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:38,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1928071536, now seen corresponding path program 1 times [2021-12-06 19:51:38,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:38,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126068981] [2021-12-06 19:51:38,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:38,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:51:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:51:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:51:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-06 19:51:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 19:51:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-06 19:51:38,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:38,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126068981] [2021-12-06 19:51:38,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126068981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:38,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:51:38,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 19:51:38,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3854543] [2021-12-06 19:51:38,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:38,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 19:51:38,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 19:51:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 19:51:38,615 INFO L87 Difference]: Start difference. First operand 1796 states and 2001 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:51:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:39,214 INFO L93 Difference]: Finished difference Result 1939 states and 2144 transitions. [2021-12-06 19:51:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 19:51:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2021-12-06 19:51:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:39,218 INFO L225 Difference]: With dead ends: 1939 [2021-12-06 19:51:39,218 INFO L226 Difference]: Without dead ends: 1936 [2021-12-06 19:51:39,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-06 19:51:39,219 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 671 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:39,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 904 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 19:51:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2021-12-06 19:51:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1795. [2021-12-06 19:51:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1529 states have (on average 1.1033355134074558) internal successors, (1687), 1540 states have internal predecessors, (1687), 152 states have call successors, (152), 106 states have call predecessors, (152), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2021-12-06 19:51:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 1998 transitions. [2021-12-06 19:51:39,343 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 1998 transitions. Word has length 203 [2021-12-06 19:51:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:39,343 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 1998 transitions. [2021-12-06 19:51:39,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:51:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 1998 transitions. [2021-12-06 19:51:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-06 19:51:39,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:39,345 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:39,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-06 19:51:39,345 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:39,346 INFO L85 PathProgramCache]: Analyzing trace with hash 704894808, now seen corresponding path program 1 times [2021-12-06 19:51:39,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:39,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809996672] [2021-12-06 19:51:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:39,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:51:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 19:51:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 19:51:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 19:51:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 19:51:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 19:51:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:51:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 19:51:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-06 19:51:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 19:51:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-06 19:51:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:51:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-06 19:51:39,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:51:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809996672] [2021-12-06 19:51:39,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809996672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:51:39,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:51:39,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:51:39,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285075986] [2021-12-06 19:51:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:51:39,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:51:39,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:51:39,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:51:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:51:39,404 INFO L87 Difference]: Start difference. First operand 1795 states and 1998 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:51:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:51:39,705 INFO L93 Difference]: Finished difference Result 2902 states and 3276 transitions. [2021-12-06 19:51:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 19:51:39,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2021-12-06 19:51:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:51:39,709 INFO L225 Difference]: With dead ends: 2902 [2021-12-06 19:51:39,709 INFO L226 Difference]: Without dead ends: 2184 [2021-12-06 19:51:39,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:51:39,710 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 194 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:51:39,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 585 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:51:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2021-12-06 19:51:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1797. [2021-12-06 19:51:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1531 states have (on average 1.1032005225342914) internal successors, (1689), 1542 states have internal predecessors, (1689), 152 states have call successors, (152), 106 states have call predecessors, (152), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2021-12-06 19:51:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2000 transitions. [2021-12-06 19:51:39,840 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2000 transitions. Word has length 207 [2021-12-06 19:51:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:51:39,840 INFO L470 AbstractCegarLoop]: Abstraction has 1797 states and 2000 transitions. [2021-12-06 19:51:39,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 19:51:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2000 transitions. [2021-12-06 19:51:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-06 19:51:39,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:51:39,842 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:39,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-06 19:51:39,842 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:51:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:51:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1606001686, now seen corresponding path program 1 times [2021-12-06 19:51:39,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:51:39,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825840909] [2021-12-06 19:51:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:51:39,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:51:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:51:39,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 19:51:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:51:39,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 19:51:39,940 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 19:51:39,940 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 19:51:39,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 19:51:39,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-06 19:51:39,944 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:51:39,947 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 19:51:40,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:51:40 BoogieIcfgContainer [2021-12-06 19:51:40,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 19:51:40,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 19:51:40,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 19:51:40,072 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 19:51:40,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:50:37" (3/4) ... [2021-12-06 19:51:40,074 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 19:51:40,198 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 19:51:40,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 19:51:40,199 INFO L158 Benchmark]: Toolchain (without parser) took 63298.74ms. Allocated memory was 88.1MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 51.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2021-12-06 19:51:40,199 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 88.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:51:40,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.57ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 51.3MB in the beginning and 77.2MB in the end (delta: -25.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-06 19:51:40,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.86ms. Allocated memory is still 107.0MB. Free memory was 76.9MB in the beginning and 74.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 19:51:40,199 INFO L158 Benchmark]: Boogie Preprocessor took 28.27ms. Allocated memory is still 107.0MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:51:40,199 INFO L158 Benchmark]: RCFGBuilder took 484.66ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 72.4MB in the end (delta: -636.8kB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2021-12-06 19:51:40,200 INFO L158 Benchmark]: TraceAbstraction took 62351.05ms. Allocated memory was 107.0MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 71.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2021-12-06 19:51:40,200 INFO L158 Benchmark]: Witness Printer took 126.36ms. Allocated memory is still 3.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-06 19:51:40,201 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.13ms. Allocated memory is still 88.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.57ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 51.3MB in the beginning and 77.2MB in the end (delta: -25.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.86ms. Allocated memory is still 107.0MB. Free memory was 76.9MB in the beginning and 74.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.27ms. Allocated memory is still 107.0MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.66ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 72.4MB in the end (delta: -636.8kB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 62351.05ms. Allocated memory was 107.0MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 71.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 126.36ms. Allocated memory is still 3.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 34.5MB). Peak memory consumption was 33.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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int t2_pc = 0; [L397] int m_st ; [L398] int t1_st ; [L399] int t2_st ; [L400] int m_i ; [L401] int t1_i ; [L402] int t2_i ; [L403] int M_E = 2; [L404] int T1_E = 2; [L405] int T2_E = 2; [L406] int E_M = 2; [L407] int E_1 = 2; [L408] int E_2 = 2; [L413] int token ; [L415] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L996] CALL main2() [L980] int __retres1 ; [L984] CALL init_model2() [L894] m_i = 1 [L895] t1_i = 1 [L896] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L984] RET init_model2() [L985] CALL start_simulation2() [L921] int kernel_st ; [L922] int tmp ; [L923] int tmp___0 ; [L927] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L928] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L929] CALL init_threads2() [L613] COND TRUE m_i == 1 [L614] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L618] COND TRUE t1_i == 1 [L619] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L623] COND TRUE t2_i == 1 [L624] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L929] RET init_threads2() [L930] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L726] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L731] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L736] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L741] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L746] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L751] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L930] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L931] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L567] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L577] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L579] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L586] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L596] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L598] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L931] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L932] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L764] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L774] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L779] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L784] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L789] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L932] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L938] kernel_st = 1 [L939] CALL eval2() [L659] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE \read(tmp_ndt_2) [L692] t1_st = 1 [L693] CALL transmit1() [L476] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L487] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L489] t1_pc = 1 [L490] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L693] RET transmit1() [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE \read(tmp_ndt_3) [L706] t2_st = 1 [L707] CALL transmit2() [L512] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L523] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L525] t2_pc = 1 [L526] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L707] RET transmit2() [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE \read(tmp_ndt_1) [L678] m_st = 1 [L679] CALL master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L431] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L434] token = __VERIFIER_nondet_int() [L435] local = token [L436] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L437] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L837] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L548] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L558] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L560] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L568] COND TRUE E_1 == 1 [L569] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L579] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L587] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L596] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L598] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L837] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L437] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L438] E_1 = 2 [L439] m_pc = 1 [L440] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L679] RET master() [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE \read(tmp_ndt_2) [L692] t1_st = 1 [L693] CALL transmit1() [L476] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L479] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L495] token += 1 [L496] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L497] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L837] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L548] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L549] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L558] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L560] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L568] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L577] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L579] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L587] COND TRUE E_2 == 1 [L588] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L598] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND TRUE \read(tmp___1) [L824] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L837] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L497] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L498] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L487] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L489] t1_pc = 1 [L490] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L693] RET transmit1() [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE \read(tmp_ndt_3) [L706] t2_st = 1 [L707] CALL transmit2() [L512] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L515] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L531] token += 1 [L532] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L533] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L837] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L548] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L549] COND TRUE E_M == 1 [L550] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L560] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L568] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L577] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L579] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L587] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L596] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L598] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L837] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L533] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L534] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L523] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L525] t2_pc = 1 [L526] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L707] RET transmit2() [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE \read(tmp_ndt_1) [L678] m_st = 1 [L679] CALL master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L423] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L445] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L450] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L451] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L456] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L457] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L458] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L459] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 212 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 62.2s, OverallIterations: 40, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11133 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10857 mSDsluCounter, 25624 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14363 mSDsCounter, 1180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8339 IncrementalHoareTripleChecker+Invalid, 9519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1180 mSolverCounterUnsat, 11261 mSDtfsCounter, 8339 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4293 GetRequests, 3978 SyntacticMatches, 6 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33161occurred in iteration=25, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 25987 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 8084 NumberOfCodeBlocks, 8084 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 7949 ConstructedInterpolants, 0 QuantifiedInterpolants, 13214 SizeOfPredicates, 13 NumberOfNonLiveVariables, 11172 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 64 InterpolantComputations, 38 PerfectInterpolantSequences, 3659/4278 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 19:51:40,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65c482b-228a-45e6-bca9-fc6dae245b65/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