./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_rmo.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_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/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 9430562edb0efade67fed3c5720bff0a3428e883 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:17:04,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:17:04,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:17:04,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:17:04,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:17:04,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:17:04,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:17:04,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:17:04,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:17:04,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:17:04,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:17:04,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:17:04,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:17:04,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:17:04,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:17:04,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:17:04,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:17:04,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:17:04,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:17:04,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:17:04,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:17:04,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:17:04,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:17:04,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:17:04,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:17:04,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:17:04,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:17:04,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:17:04,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:17:04,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:17:04,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:17:04,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:17:04,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:17:04,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:17:04,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:17:04,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:17:04,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:17:04,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:17:04,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:17:04,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:17:04,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:17:04,533 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 18:17:04,559 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:17:04,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:17:04,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:17:04,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:17:04,561 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:17:04,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:17:04,562 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:17:04,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:17:04,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:17:04,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:17:04,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:17:04,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:17:04,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:17:04,563 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:17:04,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:17:04,564 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:17:04,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:17:04,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:17:04,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:17:04,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:17:04,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 18:17:04,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:17:04,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:17:04,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:17:04,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:17:04,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:17:04,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 18:17:04,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:17:04,567 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:17:04,567 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_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/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_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/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 -> 9430562edb0efade67fed3c5720bff0a3428e883 [2020-11-29 18:17:04,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:17:04,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:17:04,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:17:04,832 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:17:04,835 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:17:04,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_rmo.opt.i [2020-11-29 18:17:04,898 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/data/d69211209/e0601812016046bfad85fb1377f200c3/FLAGb87f4a018 [2020-11-29 18:17:05,482 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:17:05,483 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/sv-benchmarks/c/pthread-wmm/mix052_rmo.opt.i [2020-11-29 18:17:05,502 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/data/d69211209/e0601812016046bfad85fb1377f200c3/FLAGb87f4a018 [2020-11-29 18:17:05,766 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/data/d69211209/e0601812016046bfad85fb1377f200c3 [2020-11-29 18:17:05,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:17:05,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:17:05,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:17:05,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:17:05,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:17:05,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:17:05" (1/1) ... [2020-11-29 18:17:05,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209fb424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:05, skipping insertion in model container [2020-11-29 18:17:05,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:17:05" (1/1) ... [2020-11-29 18:17:05,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:17:05,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:17:06,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:17:06,356 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:17:06,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:17:06,541 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:17:06,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06 WrapperNode [2020-11-29 18:17:06,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:17:06,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:17:06,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:17:06,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:17:06,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:17:06,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:17:06,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:17:06,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:17:06,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... [2020-11-29 18:17:06,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:17:06,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:17:06,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:17:06,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:17:06,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/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 18:17:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 18:17:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 18:17:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:17:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 18:17:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 18:17:06,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 18:17:06,777 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 18:17:06,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 18:17:06,778 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 18:17:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 18:17:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:17:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 18:17:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:17:06,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:17:06,781 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 18:17:09,227 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:17:09,228 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 18:17:09,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:17:09 BoogieIcfgContainer [2020-11-29 18:17:09,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:17:09,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 18:17:09,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 18:17:09,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 18:17:09,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:17:05" (1/3) ... [2020-11-29 18:17:09,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603d0b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:17:09, skipping insertion in model container [2020-11-29 18:17:09,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:06" (2/3) ... [2020-11-29 18:17:09,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603d0b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:17:09, skipping insertion in model container [2020-11-29 18:17:09,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:17:09" (3/3) ... [2020-11-29 18:17:09,241 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_rmo.opt.i [2020-11-29 18:17:09,256 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 18:17:09,257 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 18:17:09,262 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 18:17:09,263 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 18:17:09,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,318 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,318 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,319 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,320 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,322 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,327 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,334 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,339 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:17:09,345 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 18:17:09,356 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-29 18:17:09,388 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 18:17:09,389 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 18:17:09,389 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 18:17:09,389 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:17:09,389 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:17:09,389 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 18:17:09,390 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:17:09,390 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 18:17:09,409 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 18:17:09,411 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-29 18:17:09,415 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-29 18:17:09,417 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-11-29 18:17:09,460 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-11-29 18:17:09,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 18:17:09,464 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-11-29 18:17:09,468 INFO L116 LiptonReduction]: Number of co-enabled transitions 1648 [2020-11-29 18:17:09,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 18:17:09,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:09,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 18:17:09,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:09,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 18:17:09,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:10,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 18:17:10,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 18:17:10,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:17:10,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:17:10,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:10,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:10,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:10,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:10,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:10,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:10,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 18:17:10,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,130 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 18:17:10,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,132 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 18:17:10,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 18:17:10,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:10,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:10,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:10,775 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 18:17:10,913 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 18:17:11,253 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-29 18:17:11,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:17:11,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:17:11,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:11,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:11,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:11,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:11,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:11,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:11,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 18:17:11,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:11,375 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 18:17:11,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:11,382 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 18:17:11,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:11,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:11,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 18:17:11,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 18:17:11,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:11,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 18:17:11,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:11,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 18:17:11,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:11,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 18:17:11,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:11,880 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 18:17:12,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:17:12,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:17:12,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:12,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:12,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:12,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 18:17:12,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:12,622 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 18:17:12,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:12,623 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 18:17:12,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:12,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 18:17:12,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 18:17:12,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:17:12,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 18:17:12,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 18:17:12,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:17:12,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:17:12,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:17:12,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:12,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:12,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 18:17:12,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:17:12,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 18:17:12,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:12,844 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 18:17:12,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:12,847 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 18:17:12,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:17:13,620 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-29 18:17:14,250 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 18:17:14,414 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 18:17:14,422 INFO L131 LiptonReduction]: Checked pairs total: 4223 [2020-11-29 18:17:14,423 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-11-29 18:17:14,430 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-29 18:17:14,468 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 618 states. [2020-11-29 18:17:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states. [2020-11-29 18:17:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:17:14,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:14,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:14,478 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash -110011762, now seen corresponding path program 1 times [2020-11-29 18:17:14,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:14,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352250486] [2020-11-29 18:17:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:14,725 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 18:17:14,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352250486] [2020-11-29 18:17:14,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:14,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 18:17:14,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574722165] [2020-11-29 18:17:14,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:17:14,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:17:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:17:14,747 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 3 states. [2020-11-29 18:17:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:14,828 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-11-29 18:17:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:17:14,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-29 18:17:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:14,850 INFO L225 Difference]: With dead ends: 522 [2020-11-29 18:17:14,850 INFO L226 Difference]: Without dead ends: 442 [2020-11-29 18:17:14,851 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 18:17:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-29 18:17:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-11-29 18:17:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-29 18:17:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-11-29 18:17:14,931 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 7 [2020-11-29 18:17:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:14,932 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-11-29 18:17:14,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:17:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-11-29 18:17:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 18:17:14,935 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:14,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:14,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 18:17:14,936 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash -298537635, now seen corresponding path program 1 times [2020-11-29 18:17:14,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:14,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972333216] [2020-11-29 18:17:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:15,113 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 18:17:15,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972333216] [2020-11-29 18:17:15,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:15,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 18:17:15,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338381268] [2020-11-29 18:17:15,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:17:15,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:17:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:17:15,116 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 4 states. [2020-11-29 18:17:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:15,184 INFO L93 Difference]: Finished difference Result 502 states and 1454 transitions. [2020-11-29 18:17:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:17:15,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-29 18:17:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:15,199 INFO L225 Difference]: With dead ends: 502 [2020-11-29 18:17:15,199 INFO L226 Difference]: Without dead ends: 422 [2020-11-29 18:17:15,200 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 18:17:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-11-29 18:17:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2020-11-29 18:17:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-11-29 18:17:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1260 transitions. [2020-11-29 18:17:15,243 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1260 transitions. Word has length 10 [2020-11-29 18:17:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:15,244 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1260 transitions. [2020-11-29 18:17:15,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:17:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1260 transitions. [2020-11-29 18:17:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 18:17:15,246 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:15,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:15,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 18:17:15,247 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash -664654492, now seen corresponding path program 1 times [2020-11-29 18:17:15,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:15,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221480204] [2020-11-29 18:17:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:15,403 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 18:17:15,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221480204] [2020-11-29 18:17:15,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:15,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:17:15,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302149189] [2020-11-29 18:17:15,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:17:15,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:17:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:17:15,406 INFO L87 Difference]: Start difference. First operand 422 states and 1260 transitions. Second operand 4 states. [2020-11-29 18:17:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:15,456 INFO L93 Difference]: Finished difference Result 374 states and 968 transitions. [2020-11-29 18:17:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:17:15,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 18:17:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:15,461 INFO L225 Difference]: With dead ends: 374 [2020-11-29 18:17:15,461 INFO L226 Difference]: Without dead ends: 294 [2020-11-29 18:17:15,461 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 18:17:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-11-29 18:17:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2020-11-29 18:17:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-11-29 18:17:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 748 transitions. [2020-11-29 18:17:15,485 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 748 transitions. Word has length 11 [2020-11-29 18:17:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:15,486 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 748 transitions. [2020-11-29 18:17:15,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:17:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 748 transitions. [2020-11-29 18:17:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 18:17:15,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:15,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:15,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 18:17:15,494 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash 920296798, now seen corresponding path program 1 times [2020-11-29 18:17:15,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:15,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48650496] [2020-11-29 18:17:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:15,597 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 18:17:15,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48650496] [2020-11-29 18:17:15,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:15,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:17:15,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408668706] [2020-11-29 18:17:15,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:17:15,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:17:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:17:15,600 INFO L87 Difference]: Start difference. First operand 294 states and 748 transitions. Second operand 4 states. [2020-11-29 18:17:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:15,630 INFO L93 Difference]: Finished difference Result 442 states and 1066 transitions. [2020-11-29 18:17:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:17:15,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-29 18:17:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:15,633 INFO L225 Difference]: With dead ends: 442 [2020-11-29 18:17:15,633 INFO L226 Difference]: Without dead ends: 310 [2020-11-29 18:17:15,634 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 18:17:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-29 18:17:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 282. [2020-11-29 18:17:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-29 18:17:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 679 transitions. [2020-11-29 18:17:15,644 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 679 transitions. Word has length 13 [2020-11-29 18:17:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:15,645 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 679 transitions. [2020-11-29 18:17:15,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:17:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 679 transitions. [2020-11-29 18:17:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 18:17:15,646 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:15,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:15,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 18:17:15,646 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash 296841996, now seen corresponding path program 1 times [2020-11-29 18:17:15,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:15,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564535521] [2020-11-29 18:17:15,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:15,869 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 18:17:15,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564535521] [2020-11-29 18:17:15,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:15,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:17:15,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467872125] [2020-11-29 18:17:15,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:17:15,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:17:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:17:15,871 INFO L87 Difference]: Start difference. First operand 282 states and 679 transitions. Second operand 5 states. [2020-11-29 18:17:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:15,941 INFO L93 Difference]: Finished difference Result 208 states and 439 transitions. [2020-11-29 18:17:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:17:15,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-29 18:17:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:15,945 INFO L225 Difference]: With dead ends: 208 [2020-11-29 18:17:15,945 INFO L226 Difference]: Without dead ends: 164 [2020-11-29 18:17:15,945 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 18:17:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-11-29 18:17:15,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2020-11-29 18:17:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-29 18:17:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 337 transitions. [2020-11-29 18:17:15,951 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 337 transitions. Word has length 13 [2020-11-29 18:17:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:15,952 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 337 transitions. [2020-11-29 18:17:15,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:17:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 337 transitions. [2020-11-29 18:17:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 18:17:15,953 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:15,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:15,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 18:17:15,954 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 939915115, now seen corresponding path program 1 times [2020-11-29 18:17:15,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:15,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694531728] [2020-11-29 18:17:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:16,105 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 18:17:16,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694531728] [2020-11-29 18:17:16,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:16,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:17:16,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771614693] [2020-11-29 18:17:16,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:17:16,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:17:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:17:16,107 INFO L87 Difference]: Start difference. First operand 164 states and 337 transitions. Second operand 6 states. [2020-11-29 18:17:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:16,165 INFO L93 Difference]: Finished difference Result 137 states and 282 transitions. [2020-11-29 18:17:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:17:16,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-29 18:17:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:16,166 INFO L225 Difference]: With dead ends: 137 [2020-11-29 18:17:16,166 INFO L226 Difference]: Without dead ends: 84 [2020-11-29 18:17:16,167 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 18:17:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-29 18:17:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-29 18:17:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-29 18:17:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 164 transitions. [2020-11-29 18:17:16,169 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 164 transitions. Word has length 16 [2020-11-29 18:17:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:16,170 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 164 transitions. [2020-11-29 18:17:16,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:17:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 164 transitions. [2020-11-29 18:17:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 18:17:16,171 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:16,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:16,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 18:17:16,171 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1339725488, now seen corresponding path program 1 times [2020-11-29 18:17:16,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:16,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912713549] [2020-11-29 18:17:16,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:16,422 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 18:17:16,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912713549] [2020-11-29 18:17:16,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:16,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 18:17:16,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172833477] [2020-11-29 18:17:16,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 18:17:16,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 18:17:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-29 18:17:16,425 INFO L87 Difference]: Start difference. First operand 84 states and 164 transitions. Second operand 10 states. [2020-11-29 18:17:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:16,706 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2020-11-29 18:17:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 18:17:16,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-29 18:17:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:16,708 INFO L225 Difference]: With dead ends: 136 [2020-11-29 18:17:16,708 INFO L226 Difference]: Without dead ends: 88 [2020-11-29 18:17:16,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-29 18:17:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-29 18:17:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2020-11-29 18:17:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-29 18:17:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 156 transitions. [2020-11-29 18:17:16,712 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 156 transitions. Word has length 20 [2020-11-29 18:17:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:16,712 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 156 transitions. [2020-11-29 18:17:16,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 18:17:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 156 transitions. [2020-11-29 18:17:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 18:17:16,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:16,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:16,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 18:17:16,714 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2019359054, now seen corresponding path program 2 times [2020-11-29 18:17:16,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:16,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2332532] [2020-11-29 18:17:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:16,919 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 18:17:16,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2332532] [2020-11-29 18:17:16,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:16,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:17:16,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242494779] [2020-11-29 18:17:16,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:17:16,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:17:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:17:16,921 INFO L87 Difference]: Start difference. First operand 84 states and 156 transitions. Second operand 5 states. [2020-11-29 18:17:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:16,966 INFO L93 Difference]: Finished difference Result 90 states and 161 transitions. [2020-11-29 18:17:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:17:16,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-11-29 18:17:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:16,968 INFO L225 Difference]: With dead ends: 90 [2020-11-29 18:17:16,968 INFO L226 Difference]: Without dead ends: 42 [2020-11-29 18:17:16,968 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 18:17:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-29 18:17:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-29 18:17:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-29 18:17:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2020-11-29 18:17:16,970 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 20 [2020-11-29 18:17:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:16,970 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 68 transitions. [2020-11-29 18:17:16,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:17:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-11-29 18:17:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 18:17:16,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:16,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:16,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 18:17:16,971 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1489291194, now seen corresponding path program 3 times [2020-11-29 18:17:16,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:16,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944043615] [2020-11-29 18:17:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:17:17,190 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 18:17:17,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944043615] [2020-11-29 18:17:17,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:17:17,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:17:17,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775591150] [2020-11-29 18:17:17,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:17:17,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:17:17,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:17:17,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:17:17,193 INFO L87 Difference]: Start difference. First operand 42 states and 68 transitions. Second operand 7 states. [2020-11-29 18:17:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:17:17,293 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2020-11-29 18:17:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:17:17,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-11-29 18:17:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:17:17,295 INFO L225 Difference]: With dead ends: 53 [2020-11-29 18:17:17,295 INFO L226 Difference]: Without dead ends: 30 [2020-11-29 18:17:17,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-29 18:17:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-11-29 18:17:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-29 18:17:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-29 18:17:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2020-11-29 18:17:17,297 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2020-11-29 18:17:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:17:17,297 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-11-29 18:17:17,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:17:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-11-29 18:17:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 18:17:17,297 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:17:17,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:17:17,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 18:17:17,298 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:17:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:17:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1282896810, now seen corresponding path program 4 times [2020-11-29 18:17:17,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:17:17,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137764836] [2020-11-29 18:17:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:17:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:17:17,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:17:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:17:17,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:17:17,453 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:17:17,453 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 18:17:17,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 18:17:17,499 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 18:17:17,499 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [785] [2020-11-29 18:17:17,502 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 18:17:17,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,502 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 18:17:17,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,503 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 18:17:17,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,503 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 18:17:17,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,503 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 18:17:17,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,504 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 18:17:17,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,505 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 18:17:17,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,505 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 18:17:17,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,505 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 18:17:17,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,506 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 18:17:17,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,506 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 18:17:17,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,506 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 18:17:17,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,507 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 18:17:17,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,507 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 18:17:17,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,507 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 18:17:17,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,513 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 18:17:17,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,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 18:17:17,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,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 18:17:17,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,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 18:17:17,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,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 18:17:17,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,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 18:17:17,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:17:17 BasicIcfg [2020-11-29 18:17:17,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 18:17:17,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:17:17,605 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:17:17,605 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:17:17,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:17:09" (3/4) ... [2020-11-29 18:17:17,607 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 18:17:17,629 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 18:17:17,629 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [785] [2020-11-29 18:17:17,630 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 18:17:17,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,630 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 18:17:17,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,630 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 18:17:17,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,630 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 18:17:17,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,630 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 18:17:17,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,630 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 18:17:17,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,631 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 18:17:17,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,631 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 18:17:17,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,631 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 18:17:17,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,631 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 18:17:17,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,632 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 18:17:17,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,632 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 18:17:17,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,632 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 18:17:17,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,632 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 18:17:17,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,633 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 18:17:17,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,633 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 18:17:17,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,633 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 18:17:17,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,634 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 18:17:17,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,634 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 18:17:17,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,634 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 18:17:17,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,634 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 18:17:17,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:17:17,767 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_31eba50c-05d0-4f4b-948e-0fc93ad3fdf7/bin/uautomizer/witness.graphml [2020-11-29 18:17:17,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:17:17,769 INFO L168 Benchmark]: Toolchain (without parser) took 11998.50 ms. Allocated memory was 96.5 MB in the beginning and 245.4 MB in the end (delta: 148.9 MB). Free memory was 68.0 MB in the beginning and 189.2 MB in the end (delta: -121.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 16.1 GB. [2020-11-29 18:17:17,769 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 96.5 MB. Free memory was 53.4 MB in the beginning and 53.3 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:17:17,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.99 ms. Allocated memory is still 96.5 MB. Free memory was 67.7 MB in the beginning and 50.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:17:17,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.97 ms. Allocated memory is still 96.5 MB. Free memory was 50.7 MB in the beginning and 48.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:17:17,770 INFO L168 Benchmark]: Boogie Preprocessor took 52.92 ms. Allocated memory is still 96.5 MB. Free memory was 48.3 MB in the beginning and 46.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:17:17,773 INFO L168 Benchmark]: RCFGBuilder took 2570.64 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 46.2 MB in the beginning and 60.2 MB in the end (delta: -13.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:17:17,773 INFO L168 Benchmark]: TraceAbstraction took 8372.41 ms. Allocated memory was 127.9 MB in the beginning and 245.4 MB in the end (delta: 117.4 MB). Free memory was 60.2 MB in the beginning and 204.9 MB in the end (delta: -144.7 MB). Peak memory consumption was 77.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:17:17,774 INFO L168 Benchmark]: Witness Printer took 163.22 ms. Allocated memory is still 245.4 MB. Free memory was 204.9 MB in the beginning and 189.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:17:17,776 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.29 ms. Allocated memory is still 96.5 MB. Free memory was 53.4 MB in the beginning and 53.3 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 769.99 ms. Allocated memory is still 96.5 MB. Free memory was 67.7 MB in the beginning and 50.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.97 ms. Allocated memory is still 96.5 MB. Free memory was 50.7 MB in the beginning and 48.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.92 ms. Allocated memory is still 96.5 MB. Free memory was 48.3 MB in the beginning and 46.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2570.64 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 46.2 MB in the beginning and 60.2 MB in the end (delta: -13.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8372.41 ms. Allocated memory was 127.9 MB in the beginning and 245.4 MB in the end (delta: 117.4 MB). Free memory was 60.2 MB in the beginning and 204.9 MB in the end (delta: -144.7 MB). Peak memory consumption was 77.8 MB. Max. memory is 16.1 GB. * Witness Printer took 163.22 ms. Allocated memory is still 245.4 MB. Free memory was 204.9 MB in the beginning and 189.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1072 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 113 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.0s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 4223 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1400; [L824] FCALL, FORK 0 pthread_create(&t1400, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1401; [L826] FCALL, FORK 0 pthread_create(&t1401, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1402; [L828] FCALL, FORK 0 pthread_create(&t1402, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 244 SDtfs, 254 SDslu, 590 SDs, 0 SdLazy, 291 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred 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, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 8901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...