./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_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_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/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 ad3434b135a6084e5c73068837361e54ecf175f9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:03:04,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:03:04,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:03:04,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:03:04,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:03:04,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:03:04,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:03:04,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:03:04,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:03:04,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:03:04,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:03:04,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:03:04,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:03:04,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:03:04,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:03:04,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:03:04,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:03:04,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:03:04,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:03:04,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:03:04,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:03:04,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:03:04,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:03:04,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:03:04,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:03:04,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:03:04,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:03:04,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:03:04,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:03:04,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:03:04,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:03:04,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:03:04,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:03:04,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:03:04,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:03:04,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:03:04,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:03:04,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:03:04,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:03:04,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:03:04,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:03:04,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 20:03:04,396 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:03:04,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:03:04,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:03:04,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:03:04,401 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:03:04,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:03:04,401 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:03:04,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:03:04,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:03:04,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:03:04,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 20:03:04,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:03:04,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 20:03:04,404 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:03:04,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:03:04,405 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:03:04,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 20:03:04,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:03:04,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:03:04,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:03:04,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:03:04,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:03:04,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:03:04,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:03:04,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 20:03:04,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:03:04,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:03:04,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 20:03:04,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:03:04,409 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_81359027-4240-4d28-8b34-4c45ae7d56ff/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_81359027-4240-4d28-8b34-4c45ae7d56ff/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 -> ad3434b135a6084e5c73068837361e54ecf175f9 [2020-11-29 20:03:04,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:03:04,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:03:04,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:03:04,733 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:03:04,734 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:03:04,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt.i [2020-11-29 20:03:04,814 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/data/4fac957f2/75c70de8273f45848cbb5a1290c4d228/FLAGfa4b06f0a [2020-11-29 20:03:05,525 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:03:05,526 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/sv-benchmarks/c/pthread-wmm/mix035_power.opt.i [2020-11-29 20:03:05,544 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/data/4fac957f2/75c70de8273f45848cbb5a1290c4d228/FLAGfa4b06f0a [2020-11-29 20:03:05,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/data/4fac957f2/75c70de8273f45848cbb5a1290c4d228 [2020-11-29 20:03:05,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:03:05,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:03:05,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:03:05,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:03:05,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:03:05,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:03:05" (1/1) ... [2020-11-29 20:03:05,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415f5b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:05, skipping insertion in model container [2020-11-29 20:03:05,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:03:05" (1/1) ... [2020-11-29 20:03:05,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:03:05,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:03:06,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:03:06,246 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:03:06,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:03:06,449 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:03:06,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06 WrapperNode [2020-11-29 20:03:06,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:03:06,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:03:06,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:03:06,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:03:06,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:03:06,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:03:06,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:03:06,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:03:06,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... [2020-11-29 20:03:06,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:03:06,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:03:06,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:03:06,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:03:06,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/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 20:03:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 20:03:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 20:03:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:03:06,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 20:03:06,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 20:03:06,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 20:03:06,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 20:03:06,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 20:03:06,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 20:03:06,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 20:03:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:03:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 20:03:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:03:06,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:03:06,754 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 20:03:09,314 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:03:09,315 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 20:03:09,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:03:09 BoogieIcfgContainer [2020-11-29 20:03:09,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:03:09,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:03:09,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:03:09,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:03:09,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:03:05" (1/3) ... [2020-11-29 20:03:09,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7144757e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:03:09, skipping insertion in model container [2020-11-29 20:03:09,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:03:06" (2/3) ... [2020-11-29 20:03:09,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7144757e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:03:09, skipping insertion in model container [2020-11-29 20:03:09,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:03:09" (3/3) ... [2020-11-29 20:03:09,325 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2020-11-29 20:03:09,334 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 20:03:09,334 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:03:09,339 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 20:03:09,340 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 20:03:09,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,383 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,384 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,387 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,387 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,392 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,392 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,408 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,408 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 20:03:09,418 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 20:03:09,429 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-29 20:03:09,464 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:03:09,464 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 20:03:09,465 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:03:09,465 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:03:09,465 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:03:09,465 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:03:09,465 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:03:09,465 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:03:09,484 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 20:03:09,486 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 106 transitions, 227 flow [2020-11-29 20:03:09,490 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 106 transitions, 227 flow [2020-11-29 20:03:09,492 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 113 places, 106 transitions, 227 flow [2020-11-29 20:03:09,566 INFO L129 PetriNetUnfolder]: 3/103 cut-off events. [2020-11-29 20:03:09,566 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 20:03:09,571 INFO L80 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 3/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-29 20:03:09,578 INFO L116 LiptonReduction]: Number of co-enabled transitions 1934 [2020-11-29 20:03:09,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:09,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:09,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:09,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:09,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:09,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:09,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:09,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:09,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:09,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:09,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:09,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:09,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:09,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:09,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:09,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:10,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:10,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:10,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:10,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:10,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:10,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:10,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:10,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 20:03:10,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:11,256 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 20:03:11,374 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 20:03:11,644 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-29 20:03:11,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:11,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:11,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:11,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:11,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:11,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:11,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:11,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:11,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:11,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:11,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:11,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:11,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:11,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:11,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:11,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:12,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:12,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:12,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:12,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:12,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:12,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:12,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:12,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:12,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:12,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:12,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:12,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:12,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:12,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:12,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:03:12,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:03:12,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:03:12,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:12,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:12,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:03:12,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:12,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:03:12,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:12,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:03:12,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:12,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:03:12,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:12,559 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 20:03:12,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:12,561 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 20:03:12,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:12,788 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 20:03:12,913 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 20:03:13,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:13,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:13,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:13,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:13,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:13,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:13,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:13,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:03:13,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,275 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 20:03:13,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,276 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 20:03:13,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:03:13,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:03:13,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:13,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:13,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:13,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 20:03:13,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:13,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 20:03:13,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 20:03:13,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 20:03:13,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 20:03:13,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 20:03:13,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:13,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:13,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:13,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 20:03:13,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 20:03:13,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 20:03:13,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,686 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 20:03:13,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,687 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 20:03:13,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 20:03:13,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 20:03:13,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 20:03:14,672 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-11-29 20:03:14,776 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-29 20:03:15,323 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-29 20:03:15,534 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-29 20:03:15,541 INFO L131 LiptonReduction]: Checked pairs total: 5375 [2020-11-29 20:03:15,541 INFO L133 LiptonReduction]: Total number of compositions: 95 [2020-11-29 20:03:15,546 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-29 20:03:15,609 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 922 states. [2020-11-29 20:03:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states. [2020-11-29 20:03:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-29 20:03:15,616 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:15,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-29 20:03:15,617 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 977186073, now seen corresponding path program 1 times [2020-11-29 20:03:15,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:15,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243734825] [2020-11-29 20:03:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:15,878 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 20:03:15,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243734825] [2020-11-29 20:03:15,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:15,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 20:03:15,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817071458] [2020-11-29 20:03:15,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:03:15,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:03:15,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:03:15,901 INFO L87 Difference]: Start difference. First operand 922 states. Second operand 3 states. [2020-11-29 20:03:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:16,014 INFO L93 Difference]: Finished difference Result 770 states and 2434 transitions. [2020-11-29 20:03:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:03:16,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-29 20:03:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:16,049 INFO L225 Difference]: With dead ends: 770 [2020-11-29 20:03:16,049 INFO L226 Difference]: Without dead ends: 650 [2020-11-29 20:03:16,051 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 20:03:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-11-29 20:03:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-11-29 20:03:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-11-29 20:03:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2020-11-29 20:03:16,164 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2020-11-29 20:03:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:16,164 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2020-11-29 20:03:16,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:03:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2020-11-29 20:03:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 20:03:16,166 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:16,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:03:16,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:03:16,167 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1026923720, now seen corresponding path program 1 times [2020-11-29 20:03:16,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:16,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542506037] [2020-11-29 20:03:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:16,330 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 20:03:16,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542506037] [2020-11-29 20:03:16,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:16,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:03:16,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997078683] [2020-11-29 20:03:16,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:03:16,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:03:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:03:16,333 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states. [2020-11-29 20:03:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:16,410 INFO L93 Difference]: Finished difference Result 690 states and 2070 transitions. [2020-11-29 20:03:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:03:16,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-29 20:03:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:16,418 INFO L225 Difference]: With dead ends: 690 [2020-11-29 20:03:16,418 INFO L226 Difference]: Without dead ends: 570 [2020-11-29 20:03:16,420 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 20:03:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-11-29 20:03:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-11-29 20:03:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-11-29 20:03:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1744 transitions. [2020-11-29 20:03:16,447 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1744 transitions. Word has length 10 [2020-11-29 20:03:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:16,448 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 1744 transitions. [2020-11-29 20:03:16,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:03:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1744 transitions. [2020-11-29 20:03:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 20:03:16,458 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:16,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:03:16,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:03:16,458 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash -964249180, now seen corresponding path program 1 times [2020-11-29 20:03:16,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:16,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17652519] [2020-11-29 20:03:16,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:16,608 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 20:03:16,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17652519] [2020-11-29 20:03:16,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:16,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:03:16,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171374581] [2020-11-29 20:03:16,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:03:16,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:16,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:03:16,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:03:16,611 INFO L87 Difference]: Start difference. First operand 570 states and 1744 transitions. Second operand 4 states. [2020-11-29 20:03:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:16,673 INFO L93 Difference]: Finished difference Result 498 states and 1322 transitions. [2020-11-29 20:03:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:03:16,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-29 20:03:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:16,679 INFO L225 Difference]: With dead ends: 498 [2020-11-29 20:03:16,679 INFO L226 Difference]: Without dead ends: 378 [2020-11-29 20:03:16,680 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 20:03:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-11-29 20:03:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2020-11-29 20:03:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-11-29 20:03:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 976 transitions. [2020-11-29 20:03:16,713 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 976 transitions. Word has length 12 [2020-11-29 20:03:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:16,713 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 976 transitions. [2020-11-29 20:03:16,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:03:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 976 transitions. [2020-11-29 20:03:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 20:03:16,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:16,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:03:16,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:03:16,716 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1257995173, now seen corresponding path program 1 times [2020-11-29 20:03:16,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:16,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981589649] [2020-11-29 20:03:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:16,891 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 20:03:16,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981589649] [2020-11-29 20:03:16,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:16,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:03:16,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547721574] [2020-11-29 20:03:16,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:03:16,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:16,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:03:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:03:16,893 INFO L87 Difference]: Start difference. First operand 378 states and 976 transitions. Second operand 5 states. [2020-11-29 20:03:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:16,990 INFO L93 Difference]: Finished difference Result 278 states and 649 transitions. [2020-11-29 20:03:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:03:16,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-29 20:03:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:16,996 INFO L225 Difference]: With dead ends: 278 [2020-11-29 20:03:16,997 INFO L226 Difference]: Without dead ends: 218 [2020-11-29 20:03:16,997 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 20:03:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-11-29 20:03:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2020-11-29 20:03:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-11-29 20:03:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 496 transitions. [2020-11-29 20:03:17,005 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 496 transitions. Word has length 15 [2020-11-29 20:03:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:17,005 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 496 transitions. [2020-11-29 20:03:17,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:03:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 496 transitions. [2020-11-29 20:03:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 20:03:17,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:17,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:03:17,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:03:17,009 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1855165799, now seen corresponding path program 1 times [2020-11-29 20:03:17,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:17,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451399002] [2020-11-29 20:03:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:17,145 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 20:03:17,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451399002] [2020-11-29 20:03:17,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:17,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:03:17,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121730717] [2020-11-29 20:03:17,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:03:17,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:03:17,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:03:17,146 INFO L87 Difference]: Start difference. First operand 218 states and 496 transitions. Second operand 5 states. [2020-11-29 20:03:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:17,187 INFO L93 Difference]: Finished difference Result 296 states and 650 transitions. [2020-11-29 20:03:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:03:17,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-29 20:03:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:17,189 INFO L225 Difference]: With dead ends: 296 [2020-11-29 20:03:17,189 INFO L226 Difference]: Without dead ends: 224 [2020-11-29 20:03:17,190 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 20:03:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-29 20:03:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2020-11-29 20:03:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-11-29 20:03:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 479 transitions. [2020-11-29 20:03:17,195 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 479 transitions. Word has length 18 [2020-11-29 20:03:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:17,195 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 479 transitions. [2020-11-29 20:03:17,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:03:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 479 transitions. [2020-11-29 20:03:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 20:03:17,196 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:17,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:03:17,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 20:03:17,196 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash -315323135, now seen corresponding path program 2 times [2020-11-29 20:03:17,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:17,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030587600] [2020-11-29 20:03:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:17,322 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 20:03:17,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030587600] [2020-11-29 20:03:17,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:17,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:03:17,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080758686] [2020-11-29 20:03:17,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:03:17,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:17,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:03:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:03:17,324 INFO L87 Difference]: Start difference. First operand 218 states and 479 transitions. Second operand 6 states. [2020-11-29 20:03:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:17,380 INFO L93 Difference]: Finished difference Result 187 states and 416 transitions. [2020-11-29 20:03:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:03:17,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-29 20:03:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:17,381 INFO L225 Difference]: With dead ends: 187 [2020-11-29 20:03:17,381 INFO L226 Difference]: Without dead ends: 93 [2020-11-29 20:03:17,382 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 20:03:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-29 20:03:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-11-29 20:03:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-29 20:03:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions. [2020-11-29 20:03:17,384 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 18 [2020-11-29 20:03:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:17,384 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 186 transitions. [2020-11-29 20:03:17,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:03:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2020-11-29 20:03:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 20:03:17,385 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:17,385 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] [2020-11-29 20:03:17,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 20:03:17,385 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1023974982, now seen corresponding path program 1 times [2020-11-29 20:03:17,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:17,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072497239] [2020-11-29 20:03:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:17,609 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 20:03:17,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072497239] [2020-11-29 20:03:17,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:17,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:03:17,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185586466] [2020-11-29 20:03:17,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 20:03:17,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:17,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 20:03:17,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 20:03:17,611 INFO L87 Difference]: Start difference. First operand 93 states and 186 transitions. Second operand 6 states. [2020-11-29 20:03:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:17,747 INFO L93 Difference]: Finished difference Result 158 states and 307 transitions. [2020-11-29 20:03:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 20:03:17,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-29 20:03:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:17,748 INFO L225 Difference]: With dead ends: 158 [2020-11-29 20:03:17,748 INFO L226 Difference]: Without dead ends: 126 [2020-11-29 20:03:17,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 20:03:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-29 20:03:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2020-11-29 20:03:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-29 20:03:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 200 transitions. [2020-11-29 20:03:17,753 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 200 transitions. Word has length 22 [2020-11-29 20:03:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:17,753 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 200 transitions. [2020-11-29 20:03:17,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 20:03:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 200 transitions. [2020-11-29 20:03:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 20:03:17,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:17,754 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] [2020-11-29 20:03:17,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 20:03:17,754 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:17,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:17,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1795567354, now seen corresponding path program 2 times [2020-11-29 20:03:17,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:17,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858963800] [2020-11-29 20:03:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:03:18,041 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 20:03:18,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858963800] [2020-11-29 20:03:18,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:03:18,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 20:03:18,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583272575] [2020-11-29 20:03:18,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 20:03:18,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:03:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 20:03:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-29 20:03:18,043 INFO L87 Difference]: Start difference. First operand 101 states and 200 transitions. Second operand 9 states. [2020-11-29 20:03:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:03:18,214 INFO L93 Difference]: Finished difference Result 137 states and 261 transitions. [2020-11-29 20:03:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 20:03:18,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-29 20:03:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:03:18,223 INFO L225 Difference]: With dead ends: 137 [2020-11-29 20:03:18,223 INFO L226 Difference]: Without dead ends: 104 [2020-11-29 20:03:18,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-29 20:03:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-29 20:03:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2020-11-29 20:03:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-29 20:03:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 170 transitions. [2020-11-29 20:03:18,227 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 170 transitions. Word has length 22 [2020-11-29 20:03:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:03:18,227 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 170 transitions. [2020-11-29 20:03:18,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 20:03:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 170 transitions. [2020-11-29 20:03:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 20:03:18,228 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:03:18,228 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] [2020-11-29 20:03:18,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 20:03:18,228 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:03:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:03:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1876503032, now seen corresponding path program 3 times [2020-11-29 20:03:18,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:03:18,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643743816] [2020-11-29 20:03:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:03:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:03:18,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:03:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:03:18,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:03:18,365 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:03:18,366 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 20:03:18,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 20:03:18,396 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 20:03:18,396 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-11-29 20:03:18,398 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 20:03:18,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,398 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 20:03:18,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,398 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 20:03:18,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,399 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 20:03:18,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,399 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 20:03:18,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,399 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 20:03:18,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,400 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 20:03:18,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,400 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 20:03:18,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,400 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 20:03:18,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,400 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 20:03:18,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,401 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 20:03:18,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,401 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 20:03:18,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,401 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 20:03:18,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,402 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 20:03:18,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,402 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 20:03:18,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,402 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 20:03:18,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,406 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 20:03:18,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,407 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 20:03:18,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,407 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 20:03:18,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,408 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 20:03:18,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,408 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 20:03:18,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,408 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 20:03:18,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,408 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 20:03:18,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,409 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 20:03:18,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,410 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 20:03:18,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,410 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 20:03:18,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,410 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 20:03:18,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,410 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 20:03:18,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:03:18 BasicIcfg [2020-11-29 20:03:18,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:03:18,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:03:18,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:03:18,494 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:03:18,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:03:09" (3/4) ... [2020-11-29 20:03:18,497 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 20:03:18,514 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 20:03:18,514 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-11-29 20:03:18,514 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 20:03:18,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,514 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 20:03:18,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,515 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 20:03:18,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,515 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 20:03:18,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,515 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 20:03:18,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,515 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 20:03:18,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,515 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 20:03:18,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,516 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 20:03:18,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,516 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 20:03:18,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,516 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 20:03:18,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,516 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 20:03:18,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,517 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 20:03:18,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,517 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 20:03:18,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,517 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 20:03:18,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,517 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 20:03:18,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,517 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 20:03:18,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,518 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 20:03:18,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,518 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 20:03:18,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,518 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 20:03:18,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,518 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 20:03:18,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,519 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 20:03:18,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,519 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 20:03:18,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,519 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 20:03:18,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,520 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 20:03:18,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,520 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 20:03:18,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,520 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 20:03:18,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,520 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 20:03:18,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,520 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 20:03:18,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 20:03:18,615 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_81359027-4240-4d28-8b34-4c45ae7d56ff/bin/uautomizer/witness.graphml [2020-11-29 20:03:18,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:03:18,616 INFO L168 Benchmark]: Toolchain (without parser) took 12924.59 ms. Allocated memory was 100.7 MB in the beginning and 218.1 MB in the end (delta: 117.4 MB). Free memory was 69.0 MB in the beginning and 81.1 MB in the end (delta: -12.1 MB). Peak memory consumption was 103.5 MB. Max. memory is 16.1 GB. [2020-11-29 20:03:18,616 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 81.8 MB. Free memory was 43.7 MB in the beginning and 43.7 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:03:18,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.61 ms. Allocated memory is still 100.7 MB. Free memory was 68.8 MB in the beginning and 55.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 20:03:18,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.54 ms. Allocated memory is still 100.7 MB. Free memory was 55.3 MB in the beginning and 52.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:03:18,618 INFO L168 Benchmark]: Boogie Preprocessor took 100.59 ms. Allocated memory is still 100.7 MB. Free memory was 52.6 MB in the beginning and 79.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:03:18,618 INFO L168 Benchmark]: RCFGBuilder took 2684.66 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 79.8 MB in the beginning and 78.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 60.0 MB. Max. memory is 16.1 GB. [2020-11-29 20:03:18,619 INFO L168 Benchmark]: TraceAbstraction took 9174.94 ms. Allocated memory was 121.6 MB in the beginning and 218.1 MB in the end (delta: 96.5 MB). Free memory was 77.0 MB in the beginning and 101.0 MB in the end (delta: -24.1 MB). Peak memory consumption was 72.4 MB. Max. memory is 16.1 GB. [2020-11-29 20:03:18,619 INFO L168 Benchmark]: Witness Printer took 121.08 ms. Allocated memory is still 218.1 MB. Free memory was 101.0 MB in the beginning and 81.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 20:03:18,622 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.32 ms. Allocated memory is still 81.8 MB. Free memory was 43.7 MB in the beginning and 43.7 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 757.61 ms. Allocated memory is still 100.7 MB. Free memory was 68.8 MB in the beginning and 55.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.54 ms. Allocated memory is still 100.7 MB. Free memory was 55.3 MB in the beginning and 52.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 100.59 ms. Allocated memory is still 100.7 MB. Free memory was 52.6 MB in the beginning and 79.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2684.66 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 79.8 MB in the beginning and 78.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 60.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9174.94 ms. Allocated memory was 121.6 MB in the beginning and 218.1 MB in the end (delta: 96.5 MB). Free memory was 77.0 MB in the beginning and 101.0 MB in the end (delta: -24.1 MB). Peak memory consumption was 72.4 MB. Max. memory is 16.1 GB. * Witness Printer took 121.08 ms. Allocated memory is still 218.1 MB. Free memory was 101.0 MB in the beginning and 81.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1389 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 158 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.0s, 113 PlacesBefore, 37 PlacesAfterwards, 106 TransitionsBefore, 28 TransitionsAfterwards, 1934 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 5375 MoverChecksTotal - CounterExampleResult [Line: 18]: 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_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix035_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 258 SDtfs, 239 SDslu, 634 SDs, 0 SdLazy, 237 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 13296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...