./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c0c95a6c8d5d032b3cbd1021e0285dce8ef9a0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-22 12:51:33,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 12:51:33,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 12:51:33,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 12:51:33,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 12:51:33,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 12:51:33,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 12:51:33,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 12:51:33,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 12:51:33,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 12:51:33,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 12:51:33,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 12:51:33,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 12:51:33,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 12:51:33,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 12:51:33,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 12:51:33,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 12:51:33,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 12:51:33,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 12:51:33,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 12:51:33,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 12:51:33,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 12:51:33,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 12:51:33,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 12:51:33,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 12:51:33,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 12:51:33,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 12:51:33,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 12:51:33,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 12:51:33,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 12:51:33,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 12:51:33,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 12:51:33,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 12:51:33,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 12:51:33,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 12:51:33,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 12:51:33,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 12:51:33,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 12:51:33,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 12:51:33,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 12:51:33,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 12:51:33,268 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 12:51:33,296 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 12:51:33,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 12:51:33,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 12:51:33,298 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 12:51:33,298 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 12:51:33,299 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 12:51:33,299 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 12:51:33,299 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 12:51:33,300 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 12:51:33,300 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 12:51:33,300 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 12:51:33,301 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 12:51:33,301 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 12:51:33,301 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 12:51:33,302 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 12:51:33,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 12:51:33,303 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 12:51:33,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 12:51:33,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 12:51:33,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 12:51:33,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 12:51:33,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 12:51:33,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 12:51:33,305 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 12:51:33,305 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 12:51:33,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 12:51:33,306 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 12:51:33,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 12:51:33,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 12:51:33,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 12:51:33,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 12:51:33,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 12:51:33,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 12:51:33,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 12:51:33,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 12:51:33,309 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 12:51:33,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 12:51:33,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 12:51:33,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 12:51:33,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 12:51:33,311 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/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_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan 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 -> Taipan 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 -> 97c0c95a6c8d5d032b3cbd1021e0285dce8ef9a0 [2020-11-22 12:51:33,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 12:51:33,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 12:51:33,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 12:51:33,641 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 12:51:33,642 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 12:51:33,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc.i [2020-11-22 12:51:33,722 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/data/9f716c10c/1d4732fda604481881e33b9d2ec70dd9/FLAGbdc81436d [2020-11-22 12:51:34,428 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 12:51:34,429 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc.i [2020-11-22 12:51:34,463 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/data/9f716c10c/1d4732fda604481881e33b9d2ec70dd9/FLAGbdc81436d [2020-11-22 12:51:34,680 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/data/9f716c10c/1d4732fda604481881e33b9d2ec70dd9 [2020-11-22 12:51:34,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 12:51:34,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 12:51:34,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 12:51:34,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 12:51:34,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 12:51:34,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:51:34" (1/1) ... [2020-11-22 12:51:34,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d494a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:34, skipping insertion in model container [2020-11-22 12:51:34,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:51:34" (1/1) ... [2020-11-22 12:51:34,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 12:51:34,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 12:51:35,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:51:35,414 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 12:51:35,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:51:35,625 INFO L208 MainTranslator]: Completed translation [2020-11-22 12:51:35,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35 WrapperNode [2020-11-22 12:51:35,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 12:51:35,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 12:51:35,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 12:51:35,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 12:51:35,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 12:51:35,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 12:51:35,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 12:51:35,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 12:51:35,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... [2020-11-22 12:51:35,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 12:51:35,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 12:51:35,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 12:51:35,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 12:51:35,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/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-22 12:51:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-22 12:51:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 12:51:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 12:51:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 12:51:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 12:51:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 12:51:35,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 12:51:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 12:51:35,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 12:51:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 12:51:35,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 12:51:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 12:51:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 12:51:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 12:51:35,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 12:51:35,896 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-22 12:51:38,772 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 12:51:38,772 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-22 12:51:38,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:51:38 BoogieIcfgContainer [2020-11-22 12:51:38,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 12:51:38,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 12:51:38,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 12:51:38,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 12:51:38,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:51:34" (1/3) ... [2020-11-22 12:51:38,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8aabff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:51:38, skipping insertion in model container [2020-11-22 12:51:38,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:51:35" (2/3) ... [2020-11-22 12:51:38,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8aabff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:51:38, skipping insertion in model container [2020-11-22 12:51:38,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:51:38" (3/3) ... [2020-11-22 12:51:38,787 INFO L111 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc.i [2020-11-22 12:51:38,801 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 12:51:38,801 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 12:51:38,806 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-22 12:51:38,807 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 12:51:38,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,893 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,894 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,905 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,905 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,912 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,912 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:51:38,920 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 12:51:38,934 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-11-22 12:51:38,975 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 12:51:38,976 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 12:51:38,976 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 12:51:38,976 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 12:51:38,976 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 12:51:38,976 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 12:51:38,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 12:51:38,977 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 12:51:38,996 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 12:51:38,998 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 251 flow [2020-11-22 12:51:39,001 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 251 flow [2020-11-22 12:51:39,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2020-11-22 12:51:39,093 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-11-22 12:51:39,093 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 12:51:39,099 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-11-22 12:51:39,106 INFO L116 LiptonReduction]: Number of co-enabled transitions 1562 [2020-11-22 12:51:39,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:39,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:39,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:39,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:39,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:39,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:39,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:39,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:39,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:39,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:39,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 12:51:39,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:51:39,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 12:51:39,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:51:39,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-22 12:51:39,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:51:39,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-11-22 12:51:39,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:39,853 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-22 12:51:39,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:39,856 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-22 12:51:39,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:39,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-22 12:51:39,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:39,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-22 12:51:39,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 12:51:39,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-11-22 12:51:39,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:41,823 WARN L193 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-11-22 12:51:41,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-22 12:51:41,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,678 WARN L193 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-11-22 12:51:42,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:42,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:42,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:42,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:42,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:42,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:42,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:42,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:42,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:42,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:42,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:42,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:42,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:42,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:42,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:42,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:43,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-22 12:51:43,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-22 12:51:43,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-22 12:51:43,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-22 12:51:43,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:43,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:43,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-11-22 12:51:43,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:43,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-22 12:51:43,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:43,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-11-22 12:51:43,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:43,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-11-22 12:51:43,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:43,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-11-22 12:51:43,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:43,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:43,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-11-22 12:51:43,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:51:43,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-11-22 12:51:43,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:44,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:44,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:44,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:44,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:44,747 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-11-22 12:51:44,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:44,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:44,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:44,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:44,926 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-22 12:51:44,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:45,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:45,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:45,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:45,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:45,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,004 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-22 12:51:46,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:46,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:46,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:46,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:46,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:46,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:46,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,596 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-22 12:51:46,727 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-22 12:51:46,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-22 12:51:46,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:46,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:51:46,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:51:46,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:51:46,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:46,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-11-22 12:51:46,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:51:47,443 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-22 12:51:47,669 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-22 12:51:48,616 WARN L193 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2020-11-22 12:51:49,113 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-11-22 12:51:49,117 INFO L131 LiptonReduction]: Checked pairs total: 4133 [2020-11-22 12:51:49,118 INFO L133 LiptonReduction]: Total number of compositions: 112 [2020-11-22 12:51:49,123 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2020-11-22 12:51:49,161 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 522 states. [2020-11-22 12:51:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states. [2020-11-22 12:51:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-22 12:51:49,170 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:49,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:49,171 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 830378078, now seen corresponding path program 1 times [2020-11-22 12:51:49,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:49,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851899234] [2020-11-22 12:51:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:49,441 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-22 12:51:49,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851899234] [2020-11-22 12:51:49,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:49,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:51:49,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196123480] [2020-11-22 12:51:49,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-22 12:51:49,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-22 12:51:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-22 12:51:49,471 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 2 states. [2020-11-22 12:51:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:49,529 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-11-22 12:51:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-22 12:51:49,530 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-11-22 12:51:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:49,560 INFO L225 Difference]: With dead ends: 522 [2020-11-22 12:51:49,561 INFO L226 Difference]: Without dead ends: 442 [2020-11-22 12:51:49,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-22 12:51:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-22 12:51:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-11-22 12:51:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-22 12:51:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-11-22 12:51:49,680 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 8 [2020-11-22 12:51:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:49,682 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-11-22 12:51:49,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-22 12:51:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-11-22 12:51:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-22 12:51:49,687 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:49,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:49,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 12:51:49,689 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash -870922441, now seen corresponding path program 1 times [2020-11-22 12:51:49,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:49,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868641708] [2020-11-22 12:51:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:50,007 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-22 12:51:50,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868641708] [2020-11-22 12:51:50,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:50,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:51:50,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554921499] [2020-11-22 12:51:50,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:51:50,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:50,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:51:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:51:50,010 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 4 states. [2020-11-22 12:51:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:50,070 INFO L93 Difference]: Finished difference Result 490 states and 1424 transitions. [2020-11-22 12:51:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:51:50,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-22 12:51:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:50,076 INFO L225 Difference]: With dead ends: 490 [2020-11-22 12:51:50,076 INFO L226 Difference]: Without dead ends: 410 [2020-11-22 12:51:50,077 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-22 12:51:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-11-22 12:51:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-11-22 12:51:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-11-22 12:51:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1224 transitions. [2020-11-22 12:51:50,135 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1224 transitions. Word has length 10 [2020-11-22 12:51:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:50,135 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1224 transitions. [2020-11-22 12:51:50,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:51:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1224 transitions. [2020-11-22 12:51:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-22 12:51:50,138 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:50,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:50,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 12:51:50,138 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1292502143, now seen corresponding path program 1 times [2020-11-22 12:51:50,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:50,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776615499] [2020-11-22 12:51:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:50,284 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-22 12:51:50,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776615499] [2020-11-22 12:51:50,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:50,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:51:50,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564407187] [2020-11-22 12:51:50,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:51:50,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:50,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:51:50,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:51:50,286 INFO L87 Difference]: Start difference. First operand 410 states and 1224 transitions. Second operand 4 states. [2020-11-22 12:51:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:50,335 INFO L93 Difference]: Finished difference Result 442 states and 1272 transitions. [2020-11-22 12:51:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:51:50,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-22 12:51:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:50,341 INFO L225 Difference]: With dead ends: 442 [2020-11-22 12:51:50,341 INFO L226 Difference]: Without dead ends: 378 [2020-11-22 12:51:50,341 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-22 12:51:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-11-22 12:51:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2020-11-22 12:51:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-11-22 12:51:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1112 transitions. [2020-11-22 12:51:50,365 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1112 transitions. Word has length 11 [2020-11-22 12:51:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:50,366 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 1112 transitions. [2020-11-22 12:51:50,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:51:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1112 transitions. [2020-11-22 12:51:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 12:51:50,373 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:50,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:50,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 12:51:50,373 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:50,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:50,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1459024118, now seen corresponding path program 1 times [2020-11-22 12:51:50,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:50,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367285153] [2020-11-22 12:51:50,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:50,555 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-22 12:51:50,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367285153] [2020-11-22 12:51:50,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:50,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:51:50,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960294210] [2020-11-22 12:51:50,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:51:50,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:50,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:51:50,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:51:50,557 INFO L87 Difference]: Start difference. First operand 378 states and 1112 transitions. Second operand 5 states. [2020-11-22 12:51:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:50,660 INFO L93 Difference]: Finished difference Result 490 states and 1408 transitions. [2020-11-22 12:51:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:51:50,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-22 12:51:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:50,664 INFO L225 Difference]: With dead ends: 490 [2020-11-22 12:51:50,664 INFO L226 Difference]: Without dead ends: 250 [2020-11-22 12:51:50,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:51:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-11-22 12:51:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2020-11-22 12:51:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-11-22 12:51:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 672 transitions. [2020-11-22 12:51:50,676 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 672 transitions. Word has length 12 [2020-11-22 12:51:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:50,677 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 672 transitions. [2020-11-22 12:51:50,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:51:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 672 transitions. [2020-11-22 12:51:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 12:51:50,684 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:50,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:50,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 12:51:50,684 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash -169753408, now seen corresponding path program 1 times [2020-11-22 12:51:50,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:50,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56148285] [2020-11-22 12:51:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:50,822 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-22 12:51:50,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56148285] [2020-11-22 12:51:50,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:50,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:51:50,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335100786] [2020-11-22 12:51:50,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:51:50,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:50,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:51:50,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:51:50,824 INFO L87 Difference]: Start difference. First operand 250 states and 672 transitions. Second operand 5 states. [2020-11-22 12:51:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:50,895 INFO L93 Difference]: Finished difference Result 328 states and 851 transitions. [2020-11-22 12:51:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:51:50,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-22 12:51:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:50,898 INFO L225 Difference]: With dead ends: 328 [2020-11-22 12:51:50,898 INFO L226 Difference]: Without dead ends: 140 [2020-11-22 12:51:50,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:51:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-22 12:51:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-11-22 12:51:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-22 12:51:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 332 transitions. [2020-11-22 12:51:50,905 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 332 transitions. Word has length 13 [2020-11-22 12:51:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:50,905 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 332 transitions. [2020-11-22 12:51:50,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:51:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 332 transitions. [2020-11-22 12:51:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:51:50,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:50,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:50,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 12:51:50,906 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:50,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:50,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1595482652, now seen corresponding path program 1 times [2020-11-22 12:51:50,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:50,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176747543] [2020-11-22 12:51:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:51,509 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2020-11-22 12:51:51,658 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2020-11-22 12:51:51,731 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-22 12:51:51,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176747543] [2020-11-22 12:51:51,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:51,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:51:51,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343568400] [2020-11-22 12:51:51,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-22 12:51:51,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-22 12:51:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:51:51,734 INFO L87 Difference]: Start difference. First operand 140 states and 332 transitions. Second operand 8 states. [2020-11-22 12:51:52,047 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-11-22 12:51:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:52,101 INFO L93 Difference]: Finished difference Result 148 states and 340 transitions. [2020-11-22 12:51:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:51:52,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-22 12:51:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:52,103 INFO L225 Difference]: With dead ends: 148 [2020-11-22 12:51:52,103 INFO L226 Difference]: Without dead ends: 132 [2020-11-22 12:51:52,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:51:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-22 12:51:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-22 12:51:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-22 12:51:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 308 transitions. [2020-11-22 12:51:52,109 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 308 transitions. Word has length 15 [2020-11-22 12:51:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:52,109 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 308 transitions. [2020-11-22 12:51:52,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-22 12:51:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 308 transitions. [2020-11-22 12:51:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:51:52,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:52,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:52,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 12:51:52,111 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1980841294, now seen corresponding path program 1 times [2020-11-22 12:51:52,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:52,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356194476] [2020-11-22 12:51:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:52,238 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-22 12:51:52,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356194476] [2020-11-22 12:51:52,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:52,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:51:52,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42848352] [2020-11-22 12:51:52,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:51:52,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:52,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:51:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:51:52,240 INFO L87 Difference]: Start difference. First operand 132 states and 308 transitions. Second operand 4 states. [2020-11-22 12:51:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:52,275 INFO L93 Difference]: Finished difference Result 138 states and 292 transitions. [2020-11-22 12:51:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:51:52,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-22 12:51:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:52,277 INFO L225 Difference]: With dead ends: 138 [2020-11-22 12:51:52,277 INFO L226 Difference]: Without dead ends: 112 [2020-11-22 12:51:52,277 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-22 12:51:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-22 12:51:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-22 12:51:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-22 12:51:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 240 transitions. [2020-11-22 12:51:52,281 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 240 transitions. Word has length 16 [2020-11-22 12:51:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:52,282 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 240 transitions. [2020-11-22 12:51:52,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:51:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 240 transitions. [2020-11-22 12:51:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 12:51:52,282 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:52,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:52,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 12:51:52,283 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:52,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1558543474, now seen corresponding path program 1 times [2020-11-22 12:51:52,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:52,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365653200] [2020-11-22 12:51:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:52,390 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-22 12:51:52,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365653200] [2020-11-22 12:51:52,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:52,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:51:52,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332036904] [2020-11-22 12:51:52,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:51:52,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:51:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:51:52,392 INFO L87 Difference]: Start difference. First operand 112 states and 240 transitions. Second operand 5 states. [2020-11-22 12:51:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:52,467 INFO L93 Difference]: Finished difference Result 98 states and 185 transitions. [2020-11-22 12:51:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:51:52,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-22 12:51:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:52,470 INFO L225 Difference]: With dead ends: 98 [2020-11-22 12:51:52,471 INFO L226 Difference]: Without dead ends: 80 [2020-11-22 12:51:52,471 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-22 12:51:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-22 12:51:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-11-22 12:51:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-22 12:51:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 148 transitions. [2020-11-22 12:51:52,475 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 148 transitions. Word has length 17 [2020-11-22 12:51:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:52,475 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 148 transitions. [2020-11-22 12:51:52,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:51:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 148 transitions. [2020-11-22 12:51:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-22 12:51:52,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:52,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:51:52,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 12:51:52,477 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 314352554, now seen corresponding path program 1 times [2020-11-22 12:51:52,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:52,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100934846] [2020-11-22 12:51:52,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:51:52,599 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-22 12:51:52,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100934846] [2020-11-22 12:51:52,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:51:52,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:51:52,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924561094] [2020-11-22 12:51:52,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:51:52,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:51:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:51:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:51:52,601 INFO L87 Difference]: Start difference. First operand 80 states and 148 transitions. Second operand 6 states. [2020-11-22 12:51:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:51:52,675 INFO L93 Difference]: Finished difference Result 67 states and 120 transitions. [2020-11-22 12:51:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:51:52,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-22 12:51:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:51:52,677 INFO L225 Difference]: With dead ends: 67 [2020-11-22 12:51:52,677 INFO L226 Difference]: Without dead ends: 60 [2020-11-22 12:51:52,678 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-22 12:51:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-22 12:51:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-11-22 12:51:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-22 12:51:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 108 transitions. [2020-11-22 12:51:52,681 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 108 transitions. Word has length 18 [2020-11-22 12:51:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:51:52,682 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 108 transitions. [2020-11-22 12:51:52,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:51:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 108 transitions. [2020-11-22 12:51:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 12:51:52,682 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:51:52,682 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-22 12:51:52,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 12:51:52,683 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:51:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:51:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1609507362, now seen corresponding path program 1 times [2020-11-22 12:51:52,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:51:52,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453437809] [2020-11-22 12:51:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:51:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:51:52,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:51:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:51:52,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:51:52,929 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 12:51:52,930 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 12:51:52,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 12:51:52,968 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-22 12:51:52,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,968 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-22 12:51:52,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,969 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-22 12:51:52,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,969 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-22 12:51:52,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,970 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-22 12:51:52,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,970 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-22 12:51:52,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,971 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-22 12:51:52,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,971 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-22 12:51:52,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,972 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-22 12:51:52,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,972 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-22 12:51:52,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,973 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-22 12:51:52,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,973 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-22 12:51:52,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,975 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-22 12:51:52,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,975 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-22 12:51:52,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,981 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-22 12:51:52,981 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,981 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-22 12:51:52,981 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,982 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-22 12:51:52,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,982 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-22 12:51:52,983 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,983 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-22 12:51:52,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,984 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-22 12:51:52,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,984 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-22 12:51:52,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,984 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-22 12:51:52,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,985 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-22 12:51:52,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,985 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-22 12:51:52,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:52,986 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-22 12:51:52,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:51:53 BasicIcfg [2020-11-22 12:51:53,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 12:51:53,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 12:51:53,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 12:51:53,149 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 12:51:53,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:51:38" (3/4) ... [2020-11-22 12:51:53,151 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 12:51:53,169 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-22 12:51:53,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,171 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-22 12:51:53,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,171 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-22 12:51:53,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,172 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-22 12:51:53,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,172 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-22 12:51:53,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,173 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-22 12:51:53,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,174 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-22 12:51:53,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,174 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-22 12:51:53,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,175 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-22 12:51:53,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,175 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-22 12:51:53,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,175 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-22 12:51:53,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,175 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-22 12:51:53,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,179 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-22 12:51:53,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,180 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-22 12:51:53,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,180 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-22 12:51:53,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,180 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-22 12:51:53,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,181 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-22 12:51:53,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,181 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-22 12:51:53,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,182 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-22 12:51:53,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,182 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-22 12:51:53,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,182 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-22 12:51:53,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,182 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-22 12:51:53,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,183 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-22 12:51:53,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,183 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-22 12:51:53,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,183 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-22 12:51:53,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:51:53,387 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8bb1c589-6455-441e-8747-c47e09982fef/bin/utaipan/witness.graphml [2020-11-22 12:51:53,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 12:51:53,388 INFO L168 Benchmark]: Toolchain (without parser) took 18703.79 ms. Allocated memory was 83.9 MB in the beginning and 299.9 MB in the end (delta: 216.0 MB). Free memory was 49.1 MB in the beginning and 242.7 MB in the end (delta: -193.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 16.1 GB. [2020-11-22 12:51:53,389 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 83.9 MB. Free memory was 63.3 MB in the beginning and 63.3 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 12:51:53,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 942.28 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 48.9 MB in the beginning and 58.8 MB in the end (delta: -9.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-22 12:51:53,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.72 ms. Allocated memory is still 109.1 MB. Free memory was 58.8 MB in the beginning and 56.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:51:53,393 INFO L168 Benchmark]: Boogie Preprocessor took 92.54 ms. Allocated memory is still 109.1 MB. Free memory was 56.7 MB in the beginning and 54.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:51:53,393 INFO L168 Benchmark]: RCFGBuilder took 2946.30 ms. Allocated memory was 109.1 MB in the beginning and 153.1 MB in the end (delta: 44.0 MB). Free memory was 54.1 MB in the beginning and 122.4 MB in the end (delta: -68.2 MB). Peak memory consumption was 37.0 MB. Max. memory is 16.1 GB. [2020-11-22 12:51:53,394 INFO L168 Benchmark]: TraceAbstraction took 14368.58 ms. Allocated memory was 153.1 MB in the beginning and 299.9 MB in the end (delta: 146.8 MB). Free memory was 122.4 MB in the beginning and 264.7 MB in the end (delta: -142.3 MB). Peak memory consumption was 169.3 MB. Max. memory is 16.1 GB. [2020-11-22 12:51:53,394 INFO L168 Benchmark]: Witness Printer took 238.72 ms. Allocated memory is still 299.9 MB. Free memory was 264.7 MB in the beginning and 242.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:51:53,398 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.26 ms. Allocated memory is still 83.9 MB. Free memory was 63.3 MB in the beginning and 63.3 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 942.28 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 48.9 MB in the beginning and 58.8 MB in the end (delta: -9.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 96.72 ms. Allocated memory is still 109.1 MB. Free memory was 58.8 MB in the beginning and 56.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.54 ms. Allocated memory is still 109.1 MB. Free memory was 56.7 MB in the beginning and 54.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2946.30 ms. Allocated memory was 109.1 MB in the beginning and 153.1 MB in the end (delta: 44.0 MB). Free memory was 54.1 MB in the beginning and 122.4 MB in the end (delta: -68.2 MB). Peak memory consumption was 37.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14368.58 ms. Allocated memory was 153.1 MB in the beginning and 299.9 MB in the end (delta: 146.8 MB). Free memory was 122.4 MB in the beginning and 264.7 MB in the end (delta: -142.3 MB). Peak memory consumption was 169.3 MB. Max. memory is 16.1 GB. * Witness Printer took 238.72 ms. Allocated memory is still 299.9 MB. Free memory was 264.7 MB in the beginning and 242.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1088 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 10 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 125 PlacesBefore, 34 PlacesAfterwards, 118 TransitionsBefore, 25 TransitionsAfterwards, 1562 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 4133 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=0, x=0, y=0, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=0, x=0, y=0, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L769] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1) [L769] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L770] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used) [L770] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L773] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L773] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L773] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __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=2, weak$$choice1=0, weak$$choice2=255, x=0, y=0, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __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=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L793] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=0, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L808] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x=1, y=1, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe007_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={5:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 213 SDtfs, 234 SDslu, 356 SDs, 0 SdLazy, 173 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 13791 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...