./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer --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 0912942ac77c546b66f7888604225a6b4d35e180 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 19:39:29,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:39:29,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:39:29,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:39:29,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:39:29,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:39:29,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:39:29,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:39:29,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:39:29,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:39:29,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:39:29,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:39:29,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:39:29,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:39:29,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:39:29,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:39:29,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:39:29,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:39:29,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:39:29,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:39:29,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:39:29,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:39:29,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:39:29,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:39:29,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:39:29,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:39:29,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:39:29,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:39:29,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:39:29,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:39:29,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:39:29,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:39:29,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:39:29,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:39:29,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:39:29,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:39:29,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:39:29,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:39:29,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:39:29,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:39:29,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:39:29,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:39:29,750 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:39:29,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:39:29,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:39:29,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:39:29,753 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:39:29,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:39:29,754 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:39:29,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:39:29,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:39:29,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:39:29,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:39:29,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:39:29,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:39:29,756 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:39:29,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:39:29,756 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:39:29,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:39:29,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:39:29,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:39:29,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:39:29,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:39:29,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:39:29,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:39:29,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:39:29,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:39:29,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:39:29,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:39:29,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:39:29,759 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:39:29,760 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-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/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-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer 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 -> 0912942ac77c546b66f7888604225a6b4d35e180 [2020-11-29 19:39:30,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:39:30,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:39:30,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:39:30,068 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:39:30,069 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:39:30,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix029_tso.oepc.i [2020-11-29 19:39:30,142 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/data/7964ab765/e0f16a95a5d84d8f840cf4d713b9afbd/FLAG9fa7bb642 [2020-11-29 19:39:30,762 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:39:30,763 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/sv-benchmarks/c/pthread-wmm/mix029_tso.oepc.i [2020-11-29 19:39:30,784 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/data/7964ab765/e0f16a95a5d84d8f840cf4d713b9afbd/FLAG9fa7bb642 [2020-11-29 19:39:31,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/data/7964ab765/e0f16a95a5d84d8f840cf4d713b9afbd [2020-11-29 19:39:31,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:39:31,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:39:31,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:39:31,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:39:31,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:39:31,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c004ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31, skipping insertion in model container [2020-11-29 19:39:31,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:39:31,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:39:31,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:39:31,588 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:39:31,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:39:31,763 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:39:31,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31 WrapperNode [2020-11-29 19:39:31,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:39:31,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:39:31,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:39:31,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:39:31,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:39:31,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:39:31,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:39:31,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:39:31,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... [2020-11-29 19:39:31,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:39:31,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:39:31,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:39:31,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:39:31,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:39:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:39:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 19:39:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:39:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:39:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 19:39:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 19:39:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 19:39:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 19:39:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 19:39:32,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 19:39:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-29 19:39:32,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-29 19:39:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:39:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 19:39:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:39:32,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:39:32,010 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-29 19:39:35,121 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:39:35,121 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 19:39:35,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:39:35 BoogieIcfgContainer [2020-11-29 19:39:35,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:39:35,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:39:35,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:39:35,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:39:35,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:39:31" (1/3) ... [2020-11-29 19:39:35,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c17215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:39:35, skipping insertion in model container [2020-11-29 19:39:35,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:39:31" (2/3) ... [2020-11-29 19:39:35,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c17215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:39:35, skipping insertion in model container [2020-11-29 19:39:35,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:39:35" (3/3) ... [2020-11-29 19:39:35,132 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_tso.oepc.i [2020-11-29 19:39:35,142 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 19:39:35,143 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:39:35,147 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 19:39:35,148 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 19:39:35,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,198 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,206 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,206 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,206 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,209 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,210 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,210 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,212 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,213 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,220 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,223 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,227 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,234 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:39:35,240 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 19:39:35,252 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 19:39:35,271 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:39:35,271 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:39:35,271 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:39:35,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:39:35,272 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:39:35,272 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:39:35,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:39:35,272 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:39:35,288 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 19:39:35,290 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-29 19:39:35,293 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-29 19:39:35,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-29 19:39:35,354 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-29 19:39:35,355 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 19:39:35,362 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2020-11-29 19:39:35,369 INFO L116 LiptonReduction]: Number of co-enabled transitions 3014 [2020-11-29 19:39:35,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:35,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:35,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:35,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:35,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:39:36,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:39:36,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:36,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:39:36,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:39:36,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:39:36,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:39:36,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:36,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:36,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:36,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:36,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:36,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:36,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:39:36,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:39:36,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:36,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:36,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:36,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:36,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:36,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:36,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:37,055 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-29 19:39:37,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:37,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:39:37,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:39:37,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:37,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:37,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:37,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:39:37,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:39:37,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:37,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:39:37,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:39:37,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:39:37,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:39:37,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:37,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:37,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:37,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:39:37,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:37,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:37,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:37,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:37,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,211 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-29 19:39:38,328 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 19:39:38,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:38,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:38,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:39:38,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:38,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 19:39:38,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:38,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 19:39:38,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:38,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:38,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:39:38,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:38,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 19:39:38,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:38,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 19:39:38,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:38,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:38,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:38,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:38,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:38,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:38,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:38,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:38,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:38,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:38,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:38,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:38,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:38,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:38,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:39,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:39,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:39,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:39,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:39,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:39,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:39,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:39,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:39:39,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:39,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:39,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:39,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:39,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:39:39,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:39,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:39:39,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:39:39,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:39:39,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:39:40,316 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-29 19:39:40,469 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-29 19:39:41,013 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-29 19:39:41,224 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-29 19:39:41,239 INFO L131 LiptonReduction]: Checked pairs total: 8730 [2020-11-29 19:39:41,240 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-11-29 19:39:41,245 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-11-29 19:39:41,663 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5774 states. [2020-11-29 19:39:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states. [2020-11-29 19:39:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-29 19:39:41,670 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:41,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-29 19:39:41,671 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1242998, now seen corresponding path program 1 times [2020-11-29 19:39:41,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:41,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220116390] [2020-11-29 19:39:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:41,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220116390] [2020-11-29 19:39:41,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:41,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 19:39:41,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028997164] [2020-11-29 19:39:41,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:39:41,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:39:41,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:39:41,992 INFO L87 Difference]: Start difference. First operand 5774 states. Second operand 3 states. [2020-11-29 19:39:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:42,269 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2020-11-29 19:39:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:39:42,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-29 19:39:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:42,360 INFO L225 Difference]: With dead ends: 4812 [2020-11-29 19:39:42,360 INFO L226 Difference]: Without dead ends: 4062 [2020-11-29 19:39:42,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:39:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2020-11-29 19:39:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2020-11-29 19:39:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2020-11-29 19:39:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2020-11-29 19:39:42,686 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2020-11-29 19:39:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:42,686 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2020-11-29 19:39:42,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:39:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2020-11-29 19:39:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:39:42,697 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:42,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:42,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:39:42,698 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash 742346786, now seen corresponding path program 1 times [2020-11-29 19:39:42,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:42,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594751211] [2020-11-29 19:39:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:42,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594751211] [2020-11-29 19:39:42,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:42,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:39:42,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219231605] [2020-11-29 19:39:42,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:39:42,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:42,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:39:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:39:42,876 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand 4 states. [2020-11-29 19:39:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:42,974 INFO L93 Difference]: Finished difference Result 4312 states and 16600 transitions. [2020-11-29 19:39:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:39:42,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-29 19:39:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:43,098 INFO L225 Difference]: With dead ends: 4312 [2020-11-29 19:39:43,098 INFO L226 Difference]: Without dead ends: 3562 [2020-11-29 19:39:43,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:39:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2020-11-29 19:39:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3562. [2020-11-29 19:39:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3562 states. [2020-11-29 19:39:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 13925 transitions. [2020-11-29 19:39:43,267 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 13925 transitions. Word has length 12 [2020-11-29 19:39:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:43,268 INFO L481 AbstractCegarLoop]: Abstraction has 3562 states and 13925 transitions. [2020-11-29 19:39:43,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:39:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 13925 transitions. [2020-11-29 19:39:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 19:39:43,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:43,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:43,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:39:43,273 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1070037838, now seen corresponding path program 1 times [2020-11-29 19:39:43,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:43,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843072623] [2020-11-29 19:39:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:43,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843072623] [2020-11-29 19:39:43,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:43,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:39:43,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37026946] [2020-11-29 19:39:43,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:39:43,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:39:43,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:39:43,388 INFO L87 Difference]: Start difference. First operand 3562 states and 13925 transitions. Second operand 4 states. [2020-11-29 19:39:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:43,458 INFO L93 Difference]: Finished difference Result 3982 states and 15176 transitions. [2020-11-29 19:39:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:39:43,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-29 19:39:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:43,494 INFO L225 Difference]: With dead ends: 3982 [2020-11-29 19:39:43,495 INFO L226 Difference]: Without dead ends: 3482 [2020-11-29 19:39:43,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:39:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2020-11-29 19:39:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 3482. [2020-11-29 19:39:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2020-11-29 19:39:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 13561 transitions. [2020-11-29 19:39:43,719 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 13561 transitions. Word has length 14 [2020-11-29 19:39:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:43,720 INFO L481 AbstractCegarLoop]: Abstraction has 3482 states and 13561 transitions. [2020-11-29 19:39:43,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:39:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 13561 transitions. [2020-11-29 19:39:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 19:39:43,724 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:43,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:43,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:39:43,725 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1188524557, now seen corresponding path program 1 times [2020-11-29 19:39:43,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:43,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388631965] [2020-11-29 19:39:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:43,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388631965] [2020-11-29 19:39:43,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:43,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:39:43,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080564814] [2020-11-29 19:39:43,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:39:43,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:39:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:39:43,870 INFO L87 Difference]: Start difference. First operand 3482 states and 13561 transitions. Second operand 4 states. [2020-11-29 19:39:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:43,940 INFO L93 Difference]: Finished difference Result 3256 states and 11426 transitions. [2020-11-29 19:39:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:39:43,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-29 19:39:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:43,964 INFO L225 Difference]: With dead ends: 3256 [2020-11-29 19:39:43,964 INFO L226 Difference]: Without dead ends: 2506 [2020-11-29 19:39:43,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:39:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-11-29 19:39:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-11-29 19:39:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-11-29 19:39:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 8681 transitions. [2020-11-29 19:39:44,127 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 8681 transitions. Word has length 15 [2020-11-29 19:39:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:44,128 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 8681 transitions. [2020-11-29 19:39:44,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:39:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 8681 transitions. [2020-11-29 19:39:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 19:39:44,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:44,133 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:44,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:39:44,133 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:44,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:44,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1040652618, now seen corresponding path program 1 times [2020-11-29 19:39:44,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:44,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895213084] [2020-11-29 19:39:44,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:44,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895213084] [2020-11-29 19:39:44,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:44,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:39:44,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771385898] [2020-11-29 19:39:44,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:39:44,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:44,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:39:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:39:44,269 INFO L87 Difference]: Start difference. First operand 2506 states and 8681 transitions. Second operand 4 states. [2020-11-29 19:39:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:44,325 INFO L93 Difference]: Finished difference Result 4006 states and 13456 transitions. [2020-11-29 19:39:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:39:44,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-29 19:39:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:44,347 INFO L225 Difference]: With dead ends: 4006 [2020-11-29 19:39:44,355 INFO L226 Difference]: Without dead ends: 2698 [2020-11-29 19:39:44,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:39:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2020-11-29 19:39:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2434. [2020-11-29 19:39:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-11-29 19:39:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 8135 transitions. [2020-11-29 19:39:44,511 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 8135 transitions. Word has length 18 [2020-11-29 19:39:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:44,511 INFO L481 AbstractCegarLoop]: Abstraction has 2434 states and 8135 transitions. [2020-11-29 19:39:44,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:39:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 8135 transitions. [2020-11-29 19:39:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 19:39:44,537 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:44,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:44,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:39:44,537 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:44,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:44,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1800992240, now seen corresponding path program 1 times [2020-11-29 19:39:44,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:44,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976305222] [2020-11-29 19:39:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:44,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976305222] [2020-11-29 19:39:44,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:44,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:39:44,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428150622] [2020-11-29 19:39:44,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:39:44,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:44,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:39:44,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:39:44,798 INFO L87 Difference]: Start difference. First operand 2434 states and 8135 transitions. Second operand 5 states. [2020-11-29 19:39:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:44,901 INFO L93 Difference]: Finished difference Result 1920 states and 5842 transitions. [2020-11-29 19:39:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:39:44,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-29 19:39:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:44,908 INFO L225 Difference]: With dead ends: 1920 [2020-11-29 19:39:44,908 INFO L226 Difference]: Without dead ends: 1490 [2020-11-29 19:39:44,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:39:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-11-29 19:39:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2020-11-29 19:39:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-11-29 19:39:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4453 transitions. [2020-11-29 19:39:44,964 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4453 transitions. Word has length 18 [2020-11-29 19:39:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:44,964 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 4453 transitions. [2020-11-29 19:39:44,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:39:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4453 transitions. [2020-11-29 19:39:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 19:39:44,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:44,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:44,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 19:39:44,972 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash 216811783, now seen corresponding path program 1 times [2020-11-29 19:39:44,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:44,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880937362] [2020-11-29 19:39:44,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:45,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880937362] [2020-11-29 19:39:45,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:45,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:39:45,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019166577] [2020-11-29 19:39:45,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:39:45,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:39:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:39:45,090 INFO L87 Difference]: Start difference. First operand 1490 states and 4453 transitions. Second operand 4 states. [2020-11-29 19:39:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:45,136 INFO L93 Difference]: Finished difference Result 2187 states and 6359 transitions. [2020-11-29 19:39:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:39:45,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-29 19:39:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:45,143 INFO L225 Difference]: With dead ends: 2187 [2020-11-29 19:39:45,143 INFO L226 Difference]: Without dead ends: 1562 [2020-11-29 19:39:45,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:39:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2020-11-29 19:39:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1490. [2020-11-29 19:39:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-11-29 19:39:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4302 transitions. [2020-11-29 19:39:45,197 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4302 transitions. Word has length 21 [2020-11-29 19:39:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:45,197 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 4302 transitions. [2020-11-29 19:39:45,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:39:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4302 transitions. [2020-11-29 19:39:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 19:39:45,202 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:45,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:39:45,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 19:39:45,202 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash 885135447, now seen corresponding path program 2 times [2020-11-29 19:39:45,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:45,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083888573] [2020-11-29 19:39:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:45,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083888573] [2020-11-29 19:39:45,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:45,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:39:45,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575253617] [2020-11-29 19:39:45,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:39:45,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:45,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:39:45,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:39:45,385 INFO L87 Difference]: Start difference. First operand 1490 states and 4302 transitions. Second operand 6 states. [2020-11-29 19:39:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:45,524 INFO L93 Difference]: Finished difference Result 1254 states and 3579 transitions. [2020-11-29 19:39:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:39:45,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-29 19:39:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:45,527 INFO L225 Difference]: With dead ends: 1254 [2020-11-29 19:39:45,527 INFO L226 Difference]: Without dead ends: 1078 [2020-11-29 19:39:45,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:39:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2020-11-29 19:39:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2020-11-29 19:39:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2020-11-29 19:39:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3099 transitions. [2020-11-29 19:39:45,556 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3099 transitions. Word has length 21 [2020-11-29 19:39:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:45,557 INFO L481 AbstractCegarLoop]: Abstraction has 1078 states and 3099 transitions. [2020-11-29 19:39:45,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:39:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3099 transitions. [2020-11-29 19:39:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 19:39:45,582 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:45,583 INFO L422 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] [2020-11-29 19:39:45,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:39:45,583 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:45,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1730287829, now seen corresponding path program 1 times [2020-11-29 19:39:45,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:45,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670094983] [2020-11-29 19:39:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:45,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670094983] [2020-11-29 19:39:45,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:45,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:39:45,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921429234] [2020-11-29 19:39:45,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:39:45,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:39:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:39:45,891 INFO L87 Difference]: Start difference. First operand 1078 states and 3099 transitions. Second operand 8 states. [2020-11-29 19:39:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:46,250 INFO L93 Difference]: Finished difference Result 1682 states and 4641 transitions. [2020-11-29 19:39:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:39:46,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-11-29 19:39:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:46,254 INFO L225 Difference]: With dead ends: 1682 [2020-11-29 19:39:46,255 INFO L226 Difference]: Without dead ends: 1352 [2020-11-29 19:39:46,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:39:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-11-29 19:39:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1209. [2020-11-29 19:39:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2020-11-29 19:39:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 3415 transitions. [2020-11-29 19:39:46,298 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 3415 transitions. Word has length 25 [2020-11-29 19:39:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:46,299 INFO L481 AbstractCegarLoop]: Abstraction has 1209 states and 3415 transitions. [2020-11-29 19:39:46,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:39:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 3415 transitions. [2020-11-29 19:39:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 19:39:46,302 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:46,303 INFO L422 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] [2020-11-29 19:39:46,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:39:46,303 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2120061741, now seen corresponding path program 2 times [2020-11-29 19:39:46,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:46,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647782703] [2020-11-29 19:39:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:46,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647782703] [2020-11-29 19:39:46,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:46,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:39:46,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568418765] [2020-11-29 19:39:46,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:39:46,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:46,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:39:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:39:46,434 INFO L87 Difference]: Start difference. First operand 1209 states and 3415 transitions. Second operand 7 states. [2020-11-29 19:39:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:46,526 INFO L93 Difference]: Finished difference Result 1165 states and 3324 transitions. [2020-11-29 19:39:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:39:46,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-11-29 19:39:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:46,530 INFO L225 Difference]: With dead ends: 1165 [2020-11-29 19:39:46,531 INFO L226 Difference]: Without dead ends: 638 [2020-11-29 19:39:46,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:39:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-11-29 19:39:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2020-11-29 19:39:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2020-11-29 19:39:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1827 transitions. [2020-11-29 19:39:46,557 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1827 transitions. Word has length 25 [2020-11-29 19:39:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:46,558 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 1827 transitions. [2020-11-29 19:39:46,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:39:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1827 transitions. [2020-11-29 19:39:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-29 19:39:46,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:46,562 INFO L422 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] [2020-11-29 19:39:46,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 19:39:46,562 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:46,563 INFO L82 PathProgramCache]: Analyzing trace with hash 405223997, now seen corresponding path program 1 times [2020-11-29 19:39:46,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:46,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090962398] [2020-11-29 19:39:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:46,983 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 28 [2020-11-29 19:39:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:47,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090962398] [2020-11-29 19:39:47,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:47,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 19:39:47,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854789457] [2020-11-29 19:39:47,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:39:47,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:47,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:39:47,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:39:47,134 INFO L87 Difference]: Start difference. First operand 638 states and 1827 transitions. Second operand 9 states. [2020-11-29 19:39:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:47,403 INFO L93 Difference]: Finished difference Result 949 states and 2640 transitions. [2020-11-29 19:39:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:39:47,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-29 19:39:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:47,405 INFO L225 Difference]: With dead ends: 949 [2020-11-29 19:39:47,405 INFO L226 Difference]: Without dead ends: 748 [2020-11-29 19:39:47,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-29 19:39:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2020-11-29 19:39:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 608. [2020-11-29 19:39:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-11-29 19:39:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1729 transitions. [2020-11-29 19:39:47,424 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1729 transitions. Word has length 29 [2020-11-29 19:39:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:47,424 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 1729 transitions. [2020-11-29 19:39:47,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:39:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1729 transitions. [2020-11-29 19:39:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-29 19:39:47,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:47,426 INFO L422 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] [2020-11-29 19:39:47,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 19:39:47,427 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:47,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:47,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1157480315, now seen corresponding path program 2 times [2020-11-29 19:39:47,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:47,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2338125] [2020-11-29 19:39:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:39:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:39:47,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2338125] [2020-11-29 19:39:47,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:39:47,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 19:39:47,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766950656] [2020-11-29 19:39:47,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 19:39:47,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:39:47,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:39:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:39:47,736 INFO L87 Difference]: Start difference. First operand 608 states and 1729 transitions. Second operand 9 states. [2020-11-29 19:39:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:39:48,059 INFO L93 Difference]: Finished difference Result 724 states and 2002 transitions. [2020-11-29 19:39:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:39:48,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-29 19:39:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:39:48,062 INFO L225 Difference]: With dead ends: 724 [2020-11-29 19:39:48,062 INFO L226 Difference]: Without dead ends: 593 [2020-11-29 19:39:48,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-29 19:39:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-11-29 19:39:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 464. [2020-11-29 19:39:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-29 19:39:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1303 transitions. [2020-11-29 19:39:48,079 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1303 transitions. Word has length 29 [2020-11-29 19:39:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:39:48,079 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1303 transitions. [2020-11-29 19:39:48,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 19:39:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1303 transitions. [2020-11-29 19:39:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-29 19:39:48,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:39:48,081 INFO L422 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] [2020-11-29 19:39:48,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 19:39:48,082 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:39:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:39:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1670495045, now seen corresponding path program 3 times [2020-11-29 19:39:48,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:39:48,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054990350] [2020-11-29 19:39:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:39:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:48,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:39:48,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:39:48,323 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:39:48,324 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:39:48,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 19:39:48,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,361 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [749] [2020-11-29 19:39:48,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:39:48 BasicIcfg [2020-11-29 19:39:48,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:39:48,500 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:39:48,500 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:39:48,500 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:39:48,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:39:35" (3/4) ... [2020-11-29 19:39:48,502 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 19:39:48,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,533 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [749] [2020-11-29 19:39:48,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,538 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,538 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,538 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,539 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,539 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,539 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,540 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,540 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,540 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,541 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,541 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,541 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,542 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,542 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,542 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,543 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,543 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,543 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,544 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,544 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,544 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 19:39:48,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:39:48,661 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7ab2dee0-ae95-4b2b-86c3-9aeeddbc183c/bin/uautomizer/witness.graphml [2020-11-29 19:39:48,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:39:48,662 INFO L168 Benchmark]: Toolchain (without parser) took 17592.89 ms. Allocated memory was 98.6 MB in the beginning and 664.8 MB in the end (delta: 566.2 MB). Free memory was 68.2 MB in the beginning and 537.8 MB in the end (delta: -469.7 MB). Peak memory consumption was 96.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:48,663 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 98.6 MB. Free memory is still 56.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:39:48,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.48 ms. Allocated memory was 98.6 MB in the beginning and 146.8 MB in the end (delta: 48.2 MB). Free memory was 67.8 MB in the beginning and 97.3 MB in the end (delta: -29.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:48,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.62 ms. Allocated memory is still 146.8 MB. Free memory was 97.3 MB in the beginning and 95.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:48,664 INFO L168 Benchmark]: Boogie Preprocessor took 55.51 ms. Allocated memory is still 146.8 MB. Free memory was 95.1 MB in the beginning and 92.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:48,664 INFO L168 Benchmark]: RCFGBuilder took 3211.22 ms. Allocated memory is still 146.8 MB. Free memory was 92.4 MB in the beginning and 71.7 MB in the end (delta: 20.7 MB). Peak memory consumption was 60.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:48,665 INFO L168 Benchmark]: TraceAbstraction took 13374.34 ms. Allocated memory was 146.8 MB in the beginning and 664.8 MB in the end (delta: 518.0 MB). Free memory was 71.7 MB in the beginning and 567.2 MB in the end (delta: -495.5 MB). Peak memory consumption was 251.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:48,665 INFO L168 Benchmark]: Witness Printer took 161.81 ms. Allocated memory is still 664.8 MB. Free memory was 567.2 MB in the beginning and 537.8 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:39:48,668 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.25 ms. Allocated memory is still 98.6 MB. Free memory is still 56.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 691.48 ms. Allocated memory was 98.6 MB in the beginning and 146.8 MB in the end (delta: 48.2 MB). Free memory was 67.8 MB in the beginning and 97.3 MB in the end (delta: -29.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 88.62 ms. Allocated memory is still 146.8 MB. Free memory was 97.3 MB in the beginning and 95.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.51 ms. Allocated memory is still 146.8 MB. Free memory was 95.1 MB in the beginning and 92.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3211.22 ms. Allocated memory is still 146.8 MB. Free memory was 92.4 MB in the beginning and 71.7 MB in the end (delta: 20.7 MB). Peak memory consumption was 60.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13374.34 ms. Allocated memory was 146.8 MB in the beginning and 664.8 MB in the end (delta: 518.0 MB). Free memory was 71.7 MB in the beginning and 567.2 MB in the end (delta: -495.5 MB). Peak memory consumption was 251.1 MB. Max. memory is 16.1 GB. * Witness Printer took 161.81 ms. Allocated memory is still 664.8 MB. Free memory was 567.2 MB in the beginning and 537.8 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1981 VarBasedMoverChecksPositive, 102 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 267 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.9s, 131 PlacesBefore, 48 PlacesAfterwards, 121 TransitionsBefore, 36 TransitionsAfterwards, 3014 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 8730 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t793; [L865] FCALL, FORK 0 pthread_create(&t793, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t794; [L867] FCALL, FORK 0 pthread_create(&t794, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L868] 0 pthread_t t795; [L869] FCALL, FORK 0 pthread_create(&t795, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L870] 0 pthread_t t796; [L871] FCALL, FORK 0 pthread_create(&t796, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L803] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L820] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1 [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L831] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0 [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L831] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L834] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L835] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, z=2] [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix029_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 563 SDtfs, 686 SDslu, 1366 SDs, 0 SdLazy, 509 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 748 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 42705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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! Received shutdown request...