./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt.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_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/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 2d4ca9fbc458d3e8571c8b419d355382b5088949 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:45,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:25:45,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:25:45,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:25:45,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:25:45,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:25:45,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:25:45,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:25:45,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:25:45,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:25:45,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:25:45,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:25:45,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:25:45,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:25:45,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:25:45,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:25:45,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:25:45,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:25:45,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:25:45,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:25:45,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:25:45,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:25:45,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:25:45,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:25:45,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:25:45,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:25:45,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:25:45,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:25:45,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:25:45,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:25:45,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:25:45,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:25:45,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:25:45,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:25:45,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:25:45,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:25:45,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:25:45,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:25:45,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:25:45,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:25:45,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:25:45,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:25:45,694 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:25:45,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:25:45,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:25:45,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:25:45,697 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:25:45,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:25:45,698 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:25:45,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:25:45,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:25:45,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:25:45,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:25:45,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:25:45,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:25:45,701 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:25:45,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:25:45,702 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:25:45,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:25:45,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:25:45,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:25:45,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:25:45,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:25:45,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:25:45,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:25:45,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:25:45,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:25:45,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:25:45,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:25:45,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:25:45,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:25:45,706 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_50b0a3b1-0096-490b-aad9-9648960902d9/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_50b0a3b1-0096-490b-aad9-9648960902d9/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 -> 2d4ca9fbc458d3e8571c8b419d355382b5088949 [2020-11-29 19:25:46,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:25:46,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:25:46,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:25:46,052 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:25:46,064 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:25:46,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix017_power.opt.i [2020-11-29 19:25:46,149 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/data/bad58d0ee/fcc88c5b872d401896b76de1bf2dc704/FLAG43cae2b96 [2020-11-29 19:25:46,787 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:25:46,787 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/sv-benchmarks/c/pthread-wmm/mix017_power.opt.i [2020-11-29 19:25:46,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/data/bad58d0ee/fcc88c5b872d401896b76de1bf2dc704/FLAG43cae2b96 [2020-11-29 19:25:47,061 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/data/bad58d0ee/fcc88c5b872d401896b76de1bf2dc704 [2020-11-29 19:25:47,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:25:47,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:25:47,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:25:47,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:25:47,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:25:47,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:25:47" (1/1) ... [2020-11-29 19:25:47,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462dfc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:47, skipping insertion in model container [2020-11-29 19:25:47,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:25:47" (1/1) ... [2020-11-29 19:25:47,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:25:47,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:25:47,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:25:47,785 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:25:47,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:25:48,043 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:25:48,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48 WrapperNode [2020-11-29 19:25:48,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:25:48,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:25:48,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:25:48,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:25:48,056 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:25:48" (1/1) ... [2020-11-29 19:25:48,078 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:25:48" (1/1) ... [2020-11-29 19:25:48,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:25:48,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:25:48,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:25:48,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:25:48,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... [2020-11-29 19:25:48,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... [2020-11-29 19:25:48,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... [2020-11-29 19:25:48,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... [2020-11-29 19:25:48,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... [2020-11-29 19:25:48,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... [2020-11-29 19:25:48,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... [2020-11-29 19:25:48,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:25:48,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:25:48,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:25:48,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:25:48,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/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:25:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:25:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 19:25:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:25:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:25:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 19:25:48,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 19:25:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 19:25:48,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 19:25:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 19:25:48,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 19:25:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-29 19:25:48,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-29 19:25:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:25:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 19:25:48,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:25:48,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:25:48,289 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:25:51,191 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:25:51,191 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 19:25:51,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:25:51 BoogieIcfgContainer [2020-11-29 19:25:51,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:25:51,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:25:51,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:25:51,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:25:51,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:25:47" (1/3) ... [2020-11-29 19:25:51,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cbae51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:25:51, skipping insertion in model container [2020-11-29 19:25:51,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:25:48" (2/3) ... [2020-11-29 19:25:51,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cbae51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:25:51, skipping insertion in model container [2020-11-29 19:25:51,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:25:51" (3/3) ... [2020-11-29 19:25:51,206 INFO L111 eAbstractionObserver]: Analyzing ICFG mix017_power.opt.i [2020-11-29 19:25:51,219 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 19:25:51,219 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:25:51,223 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 19:25:51,224 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 19:25:51,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,269 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,269 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,285 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,285 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,287 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,291 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,292 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,298 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,305 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,305 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,309 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:25:51,320 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 19:25:51,334 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 19:25:51,359 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:25:51,359 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:25:51,359 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:25:51,359 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:25:51,360 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:25:51,360 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:25:51,360 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:25:51,360 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:25:51,376 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 19:25:51,378 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-29 19:25:51,382 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-29 19:25:51,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-29 19:25:51,446 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-29 19:25:51,447 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 19:25:51,452 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 4. Compared 89 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-11-29 19:25:51,459 INFO L116 LiptonReduction]: Number of co-enabled transitions 2736 [2020-11-29 19:25:51,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:25:51,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,042 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-29 19:25:52,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:52,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:52,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:52,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:52,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:52,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:52,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:52,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:52,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:52,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:52,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:52,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:52,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:52,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:52,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:52,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:52,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:53,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:53,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:53,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:53,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:53,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:53,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:25:53,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:53,084 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:25:53,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:53,091 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:25:53,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:53,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:53,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:25:53,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:25:53,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:53,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:53,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:53,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:53,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:53,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,770 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 19:25:53,926 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 19:25:53,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:53,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:53,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:53,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:53,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:53,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:53,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:54,431 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 19:25:54,583 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 19:25:54,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:25:54,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:54,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:54,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:25:54,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:25:54,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:54,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:54,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:54,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:54,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:54,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:54,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:54,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:54,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:54,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:25:54,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:54,814 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:25:54,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:54,816 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:25:54,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:55,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:55,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:55,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:55,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:55,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:55,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:55,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:55,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:55,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:55,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:55,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:55,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:55,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:55,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:55,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:55,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:25:56,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:25:56,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:25:56,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:25:56,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:56,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:25:56,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,374 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:25:56,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,376 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:25:56,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:56,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:56,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:25:56,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,646 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:25:56,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,648 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:25:56,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:25:56,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:25:56,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:25:56,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:56,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:56,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:56,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:25:56,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,906 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:25:56,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,909 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:25:56,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:56,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:56,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:25:56,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:25:56,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:57,178 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-29 19:25:57,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:57,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:25:57,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:25:57,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:57,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:25:57,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:25:57,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:57,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:57,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:25:57,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:57,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:25:57,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:25:57,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:25:57,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:57,439 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:25:57,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:57,441 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:25:57,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:25:57,619 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-29 19:25:57,783 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-29 19:25:58,447 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-29 19:25:58,719 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-29 19:25:58,727 INFO L131 LiptonReduction]: Checked pairs total: 7250 [2020-11-29 19:25:58,728 INFO L133 LiptonReduction]: Total number of compositions: 100 [2020-11-29 19:25:58,734 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-29 19:25:59,053 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3690 states. [2020-11-29 19:25:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states. [2020-11-29 19:25:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 19:25:59,062 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:25:59,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:25:59,063 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:25:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:25:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1893678541, now seen corresponding path program 1 times [2020-11-29 19:25:59,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:25:59,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174454354] [2020-11-29 19:25:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:25:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:25:59,488 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:25:59,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174454354] [2020-11-29 19:25:59,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:25:59,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 19:25:59,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702977817] [2020-11-29 19:25:59,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:25:59,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:25:59,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:25:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:25:59,521 INFO L87 Difference]: Start difference. First operand 3690 states. Second operand 3 states. [2020-11-29 19:25:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:25:59,726 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-29 19:25:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:25:59,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-29 19:25:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:25:59,806 INFO L225 Difference]: With dead ends: 3082 [2020-11-29 19:25:59,806 INFO L226 Difference]: Without dead ends: 2602 [2020-11-29 19:25:59,807 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:25:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-29 19:26:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-29 19:26:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-29 19:26:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-29 19:26:00,170 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 7 [2020-11-29 19:26:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:00,172 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-29 19:26:00,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:26:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-29 19:26:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:26:00,185 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:00,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:26:00,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:26:00,186 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:00,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:00,190 INFO L82 PathProgramCache]: Analyzing trace with hash -848436762, now seen corresponding path program 1 times [2020-11-29 19:26:00,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:00,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807062323] [2020-11-29 19:26:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:00,340 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:26:00,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807062323] [2020-11-29 19:26:00,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:00,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:26:00,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198051770] [2020-11-29 19:26:00,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:26:00,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:26:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:26:00,343 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-29 19:26:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:00,443 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2020-11-29 19:26:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:26:00,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-29 19:26:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:00,475 INFO L225 Difference]: With dead ends: 2762 [2020-11-29 19:26:00,475 INFO L226 Difference]: Without dead ends: 2282 [2020-11-29 19:26:00,476 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:26:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-11-29 19:26:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-11-29 19:26:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-29 19:26:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-11-29 19:26:00,615 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2020-11-29 19:26:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:00,615 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-11-29 19:26:00,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:26:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-11-29 19:26:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 19:26:00,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:00,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:26:00,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:26:00,620 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:00,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash 459484001, now seen corresponding path program 1 times [2020-11-29 19:26:00,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:00,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005449521] [2020-11-29 19:26:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:00,844 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:26:00,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005449521] [2020-11-29 19:26:00,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:00,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:26:00,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465021567] [2020-11-29 19:26:00,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:26:00,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:26:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:26:00,846 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-11-29 19:26:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:00,952 INFO L93 Difference]: Finished difference Result 2186 states and 7492 transitions. [2020-11-29 19:26:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:26:00,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-29 19:26:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:00,973 INFO L225 Difference]: With dead ends: 2186 [2020-11-29 19:26:00,973 INFO L226 Difference]: Without dead ends: 1706 [2020-11-29 19:26:00,973 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:26:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-11-29 19:26:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2020-11-29 19:26:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2020-11-29 19:26:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 5808 transitions. [2020-11-29 19:26:01,148 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 5808 transitions. Word has length 14 [2020-11-29 19:26:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:01,149 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 5808 transitions. [2020-11-29 19:26:01,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:26:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 5808 transitions. [2020-11-29 19:26:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 19:26:01,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:01,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:26:01,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:26:01,154 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1487731484, now seen corresponding path program 1 times [2020-11-29 19:26:01,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:01,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10441123] [2020-11-29 19:26:01,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:01,343 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:26:01,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10441123] [2020-11-29 19:26:01,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:01,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:26:01,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219129514] [2020-11-29 19:26:01,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:26:01,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:26:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:26:01,346 INFO L87 Difference]: Start difference. First operand 1706 states and 5808 transitions. Second operand 5 states. [2020-11-29 19:26:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:01,439 INFO L93 Difference]: Finished difference Result 1334 states and 4105 transitions. [2020-11-29 19:26:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:26:01,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-29 19:26:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:01,451 INFO L225 Difference]: With dead ends: 1334 [2020-11-29 19:26:01,451 INFO L226 Difference]: Without dead ends: 1034 [2020-11-29 19:26:01,452 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:26:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2020-11-29 19:26:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2020-11-29 19:26:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2020-11-29 19:26:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3120 transitions. [2020-11-29 19:26:01,495 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 3120 transitions. Word has length 17 [2020-11-29 19:26:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:01,496 INFO L481 AbstractCegarLoop]: Abstraction has 1034 states and 3120 transitions. [2020-11-29 19:26:01,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:26:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 3120 transitions. [2020-11-29 19:26:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 19:26:01,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:01,499 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] [2020-11-29 19:26:01,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:26:01,500 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash -646647709, now seen corresponding path program 1 times [2020-11-29 19:26:01,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:01,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963471687] [2020-11-29 19:26:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:01,635 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:26:01,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963471687] [2020-11-29 19:26:01,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:01,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:26:01,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162139237] [2020-11-29 19:26:01,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:26:01,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:26:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:26:01,637 INFO L87 Difference]: Start difference. First operand 1034 states and 3120 transitions. Second operand 5 states. [2020-11-29 19:26:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:01,700 INFO L93 Difference]: Finished difference Result 1496 states and 4374 transitions. [2020-11-29 19:26:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:26:01,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-11-29 19:26:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:01,711 INFO L225 Difference]: With dead ends: 1496 [2020-11-29 19:26:01,712 INFO L226 Difference]: Without dead ends: 1074 [2020-11-29 19:26:01,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:26:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2020-11-29 19:26:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1034. [2020-11-29 19:26:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2020-11-29 19:26:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 2970 transitions. [2020-11-29 19:26:01,754 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 2970 transitions. Word has length 20 [2020-11-29 19:26:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:01,755 INFO L481 AbstractCegarLoop]: Abstraction has 1034 states and 2970 transitions. [2020-11-29 19:26:01,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:26:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 2970 transitions. [2020-11-29 19:26:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 19:26:01,758 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:01,759 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] [2020-11-29 19:26:01,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:26:01,759 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash 884079367, now seen corresponding path program 2 times [2020-11-29 19:26:01,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:01,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906181444] [2020-11-29 19:26:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:01,950 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:26:01,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906181444] [2020-11-29 19:26:01,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:01,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:26:01,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11414556] [2020-11-29 19:26:01,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:26:01,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:01,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:26:01,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:26:01,952 INFO L87 Difference]: Start difference. First operand 1034 states and 2970 transitions. Second operand 6 states. [2020-11-29 19:26:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:02,085 INFO L93 Difference]: Finished difference Result 841 states and 2368 transitions. [2020-11-29 19:26:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:26:02,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-29 19:26:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:02,094 INFO L225 Difference]: With dead ends: 841 [2020-11-29 19:26:02,094 INFO L226 Difference]: Without dead ends: 742 [2020-11-29 19:26:02,096 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:26:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2020-11-29 19:26:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2020-11-29 19:26:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2020-11-29 19:26:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2116 transitions. [2020-11-29 19:26:02,123 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2116 transitions. Word has length 20 [2020-11-29 19:26:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:02,123 INFO L481 AbstractCegarLoop]: Abstraction has 742 states and 2116 transitions. [2020-11-29 19:26:02,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:26:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2116 transitions. [2020-11-29 19:26:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 19:26:02,126 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:02,127 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] [2020-11-29 19:26:02,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 19:26:02,127 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:02,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1874875889, now seen corresponding path program 1 times [2020-11-29 19:26:02,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:02,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148002126] [2020-11-29 19:26:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:02,335 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:26:02,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148002126] [2020-11-29 19:26:02,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:02,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 19:26:02,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307161229] [2020-11-29 19:26:02,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 19:26:02,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:02,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 19:26:02,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-29 19:26:02,338 INFO L87 Difference]: Start difference. First operand 742 states and 2116 transitions. Second operand 10 states. [2020-11-29 19:26:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:02,681 INFO L93 Difference]: Finished difference Result 1115 states and 3000 transitions. [2020-11-29 19:26:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 19:26:02,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-11-29 19:26:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:02,689 INFO L225 Difference]: With dead ends: 1115 [2020-11-29 19:26:02,690 INFO L226 Difference]: Without dead ends: 818 [2020-11-29 19:26:02,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-11-29 19:26:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2020-11-29 19:26:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 738. [2020-11-29 19:26:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2020-11-29 19:26:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1973 transitions. [2020-11-29 19:26:02,722 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1973 transitions. Word has length 23 [2020-11-29 19:26:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:02,723 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 1973 transitions. [2020-11-29 19:26:02,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 19:26:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1973 transitions. [2020-11-29 19:26:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 19:26:02,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:02,726 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] [2020-11-29 19:26:02,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 19:26:02,727 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1140028351, now seen corresponding path program 2 times [2020-11-29 19:26:02,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:02,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269057044] [2020-11-29 19:26:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:02,952 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:26:02,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269057044] [2020-11-29 19:26:02,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:02,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:26:02,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728857202] [2020-11-29 19:26:02,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:26:02,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:02,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:26:02,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:26:02,954 INFO L87 Difference]: Start difference. First operand 738 states and 1973 transitions. Second operand 7 states. [2020-11-29 19:26:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:03,080 INFO L93 Difference]: Finished difference Result 698 states and 1892 transitions. [2020-11-29 19:26:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:26:03,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-29 19:26:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:03,085 INFO L225 Difference]: With dead ends: 698 [2020-11-29 19:26:03,085 INFO L226 Difference]: Without dead ends: 474 [2020-11-29 19:26:03,086 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:26:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-11-29 19:26:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2020-11-29 19:26:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-11-29 19:26:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1265 transitions. [2020-11-29 19:26:03,105 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1265 transitions. Word has length 23 [2020-11-29 19:26:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:03,108 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 1265 transitions. [2020-11-29 19:26:03,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:26:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1265 transitions. [2020-11-29 19:26:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 19:26:03,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:03,110 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] [2020-11-29 19:26:03,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:26:03,111 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:03,112 INFO L82 PathProgramCache]: Analyzing trace with hash 103245738, now seen corresponding path program 1 times [2020-11-29 19:26:03,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:03,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092797297] [2020-11-29 19:26:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:03,241 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:26:03,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092797297] [2020-11-29 19:26:03,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:03,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:26:03,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70153313] [2020-11-29 19:26:03,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:26:03,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:26:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:26:03,243 INFO L87 Difference]: Start difference. First operand 474 states and 1265 transitions. Second operand 5 states. [2020-11-29 19:26:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:03,287 INFO L93 Difference]: Finished difference Result 504 states and 1319 transitions. [2020-11-29 19:26:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:26:03,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-11-29 19:26:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:03,290 INFO L225 Difference]: With dead ends: 504 [2020-11-29 19:26:03,290 INFO L226 Difference]: Without dead ends: 185 [2020-11-29 19:26:03,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:26:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-11-29 19:26:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2020-11-29 19:26:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-29 19:26:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2020-11-29 19:26:03,298 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 27 [2020-11-29 19:26:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:03,298 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2020-11-29 19:26:03,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:26:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2020-11-29 19:26:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 19:26:03,300 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:03,300 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] [2020-11-29 19:26:03,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:26:03,301 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1262302150, now seen corresponding path program 2 times [2020-11-29 19:26:03,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:03,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242208299] [2020-11-29 19:26:03,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:26:03,512 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:26:03,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242208299] [2020-11-29 19:26:03,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:26:03,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 19:26:03,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313537983] [2020-11-29 19:26:03,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:26:03,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:26:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:26:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:26:03,514 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand 8 states. [2020-11-29 19:26:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:26:03,778 INFO L93 Difference]: Finished difference Result 212 states and 510 transitions. [2020-11-29 19:26:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:26:03,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-29 19:26:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:26:03,780 INFO L225 Difference]: With dead ends: 212 [2020-11-29 19:26:03,780 INFO L226 Difference]: Without dead ends: 139 [2020-11-29 19:26:03,780 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:26:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-29 19:26:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-11-29 19:26:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-11-29 19:26:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 327 transitions. [2020-11-29 19:26:03,786 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 327 transitions. Word has length 27 [2020-11-29 19:26:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:26:03,786 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 327 transitions. [2020-11-29 19:26:03,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:26:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 327 transitions. [2020-11-29 19:26:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 19:26:03,787 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:26:03,787 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] [2020-11-29 19:26:03,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 19:26:03,788 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:26:03,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:26:03,790 INFO L82 PathProgramCache]: Analyzing trace with hash 881856250, now seen corresponding path program 3 times [2020-11-29 19:26:03,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:26:03,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866530158] [2020-11-29 19:26:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:26:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:03,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:26:03,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:26:04,052 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:26:04,052 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:26:04,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 19:26:04,097 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:26:04,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,097 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:26:04,097 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [796] [2020-11-29 19:26:04,100 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:26:04,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,100 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:26:04,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,100 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:26:04,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,101 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:26:04,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,102 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:26:04,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,103 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:26:04,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,104 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:26:04,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,104 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:26:04,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,104 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:26:04,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,105 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:26:04,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,105 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:26:04,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,106 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:26:04,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,106 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:26:04,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,113 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:26:04,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,114 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:26:04,114 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,114 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:26:04,114 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,114 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:26:04,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,115 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:26:04,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,115 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:26:04,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,116 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:26:04,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,117 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:26:04,117 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,117 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:26:04,117 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,117 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:26:04,118 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,118 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:26:04,118 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:26:04 BasicIcfg [2020-11-29 19:26:04,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:26:04,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:26:04,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:26:04,228 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:26:04,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:25:51" (3/4) ... [2020-11-29 19:26:04,237 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 19:26:04,262 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:26:04,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,263 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:26:04,263 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [796] [2020-11-29 19:26:04,264 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:26:04,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,264 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:26:04,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,264 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:26:04,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,265 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:26:04,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,265 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:26:04,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,266 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:26:04,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,266 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:26:04,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,266 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:26:04,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,267 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:26:04,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,267 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:26:04,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,268 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:26:04,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,268 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:26:04,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,268 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:26:04,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,269 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:26:04,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,269 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:26:04,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,270 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:26:04,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,270 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:26:04,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,270 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:26:04,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,271 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:26:04,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,271 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:26:04,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,272 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:26:04,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,272 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:26:04,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,272 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:26:04,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,273 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:26:04,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:26:04,415 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_50b0a3b1-0096-490b-aad9-9648960902d9/bin/uautomizer/witness.graphml [2020-11-29 19:26:04,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:26:04,418 INFO L168 Benchmark]: Toolchain (without parser) took 17349.85 ms. Allocated memory was 81.8 MB in the beginning and 224.4 MB in the end (delta: 142.6 MB). Free memory was 46.5 MB in the beginning and 111.5 MB in the end (delta: -65.0 MB). Peak memory consumption was 76.8 MB. Max. memory is 16.1 GB. [2020-11-29 19:26:04,418 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 81.8 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:26:04,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 971.01 ms. Allocated memory was 81.8 MB in the beginning and 104.9 MB in the end (delta: 23.1 MB). Free memory was 46.2 MB in the beginning and 57.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:26:04,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.10 ms. Allocated memory is still 104.9 MB. Free memory was 57.7 MB in the beginning and 55.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:26:04,420 INFO L168 Benchmark]: Boogie Preprocessor took 68.92 ms. Allocated memory is still 104.9 MB. Free memory was 55.4 MB in the beginning and 52.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:26:04,420 INFO L168 Benchmark]: RCFGBuilder took 3009.18 ms. Allocated memory was 104.9 MB in the beginning and 127.9 MB in the end (delta: 23.1 MB). Free memory was 52.9 MB in the beginning and 95.2 MB in the end (delta: -42.3 MB). Peak memory consumption was 35.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:26:04,421 INFO L168 Benchmark]: TraceAbstraction took 13029.98 ms. Allocated memory was 127.9 MB in the beginning and 224.4 MB in the end (delta: 96.5 MB). Free memory was 95.2 MB in the beginning and 136.6 MB in the end (delta: -41.5 MB). Peak memory consumption was 138.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:26:04,421 INFO L168 Benchmark]: Witness Printer took 188.95 ms. Allocated memory is still 224.4 MB. Free memory was 136.6 MB in the beginning and 111.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:26:04,424 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.33 ms. Allocated memory is still 81.8 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 971.01 ms. Allocated memory was 81.8 MB in the beginning and 104.9 MB in the end (delta: 23.1 MB). Free memory was 46.2 MB in the beginning and 57.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.10 ms. Allocated memory is still 104.9 MB. Free memory was 57.7 MB in the beginning and 55.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.92 ms. Allocated memory is still 104.9 MB. Free memory was 55.4 MB in the beginning and 52.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3009.18 ms. Allocated memory was 104.9 MB in the beginning and 127.9 MB in the end (delta: 23.1 MB). Free memory was 52.9 MB in the beginning and 95.2 MB in the end (delta: -42.3 MB). Peak memory consumption was 35.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13029.98 ms. Allocated memory was 127.9 MB in the beginning and 224.4 MB in the end (delta: 96.5 MB). Free memory was 95.2 MB in the beginning and 136.6 MB in the end (delta: -41.5 MB). Peak memory consumption was 138.9 MB. Max. memory is 16.1 GB. * Witness Printer took 188.95 ms. Allocated memory is still 224.4 MB. Free memory was 136.6 MB in the beginning and 111.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1813 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 244 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.3s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 7250 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix017_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L754] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix017_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 406 SDtfs, 504 SDslu, 1091 SDs, 0 SdLazy, 388 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3690occurred 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: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 120 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 15978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...