./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/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 b30138a7a583a429d72ee4333b69e3be7558c116 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-7b2dab5 [2020-12-09 11:08:42,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 11:08:42,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 11:08:42,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 11:08:42,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 11:08:42,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 11:08:42,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 11:08:42,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 11:08:42,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 11:08:42,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 11:08:42,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 11:08:42,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 11:08:42,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 11:08:42,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 11:08:42,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 11:08:42,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 11:08:42,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 11:08:42,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 11:08:42,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 11:08:42,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 11:08:42,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 11:08:42,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 11:08:42,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 11:08:42,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 11:08:42,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 11:08:42,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 11:08:42,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 11:08:42,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 11:08:42,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 11:08:42,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 11:08:42,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 11:08:42,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 11:08:42,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 11:08:42,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 11:08:42,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 11:08:42,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 11:08:42,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 11:08:42,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 11:08:42,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 11:08:42,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 11:08:42,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 11:08:42,621 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 11:08:42,638 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 11:08:42,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 11:08:42,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 11:08:42,638 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 11:08:42,639 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 11:08:42,639 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 11:08:42,639 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 11:08:42,639 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 11:08:42,639 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 11:08:42,639 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 11:08:42,639 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 11:08:42,639 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 11:08:42,640 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 11:08:42,640 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 11:08:42,640 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 11:08:42,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 11:08:42,640 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 11:08:42,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 11:08:42,641 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 11:08:42,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 11:08:42,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 11:08:42,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 11:08:42,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 11:08:42,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 11:08:42,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 11:08:42,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 11:08:42,642 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 11:08:42,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 11:08:42,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 11:08:42,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 11:08:42,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 11:08:42,643 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_569fc1f5-6965-4ecb-bb63-13c50b402c08/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_569fc1f5-6965-4ecb-bb63-13c50b402c08/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 -> b30138a7a583a429d72ee4333b69e3be7558c116 [2020-12-09 11:08:42,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 11:08:42,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 11:08:42,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 11:08:42,841 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 11:08:42,841 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 11:08:42,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix003_rmo.oepc.i [2020-12-09 11:08:42,882 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/data/473402e1d/3bf9c2f7412e420e9702b8e6cc6fff43/FLAG88edcf46e [2020-12-09 11:08:43,322 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 11:08:43,323 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/sv-benchmarks/c/pthread-wmm/mix003_rmo.oepc.i [2020-12-09 11:08:43,338 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/data/473402e1d/3bf9c2f7412e420e9702b8e6cc6fff43/FLAG88edcf46e [2020-12-09 11:08:43,347 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/data/473402e1d/3bf9c2f7412e420e9702b8e6cc6fff43 [2020-12-09 11:08:43,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 11:08:43,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 11:08:43,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 11:08:43,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 11:08:43,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 11:08:43,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52dc9edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43, skipping insertion in model container [2020-12-09 11:08:43,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 11:08:43,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 11:08:43,500 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/sv-benchmarks/c/pthread-wmm/mix003_rmo.oepc.i[949,962] [2020-12-09 11:08:43,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 11:08:43,609 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 11:08:43,618 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/sv-benchmarks/c/pthread-wmm/mix003_rmo.oepc.i[949,962] [2020-12-09 11:08:43,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 11:08:43,704 INFO L208 MainTranslator]: Completed translation [2020-12-09 11:08:43,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43 WrapperNode [2020-12-09 11:08:43,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 11:08:43,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 11:08:43,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 11:08:43,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 11:08:43,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 11:08:43,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 11:08:43,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 11:08:43,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 11:08:43,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... [2020-12-09 11:08:43,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 11:08:43,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 11:08:43,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 11:08:43,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 11:08:43,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/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-12-09 11:08:43,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 11:08:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 11:08:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 11:08:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 11:08:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 11:08:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 11:08:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 11:08:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 11:08:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 11:08:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 11:08:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 11:08:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 11:08:43,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 11:08:43,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 11:08:43,847 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 11:08:45,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 11:08:45,295 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 11:08:45,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:08:45 BoogieIcfgContainer [2020-12-09 11:08:45,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 11:08:45,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 11:08:45,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 11:08:45,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 11:08:45,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:08:43" (1/3) ... [2020-12-09 11:08:45,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29048b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:08:45, skipping insertion in model container [2020-12-09 11:08:45,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:08:43" (2/3) ... [2020-12-09 11:08:45,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29048b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:08:45, skipping insertion in model container [2020-12-09 11:08:45,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:08:45" (3/3) ... [2020-12-09 11:08:45,302 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_rmo.oepc.i [2020-12-09 11:08:45,312 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 11:08:45,312 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 11:08:45,315 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 11:08:45,315 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 11:08:45,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,345 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,377 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,378 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,379 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 11:08:45,385 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 11:08:45,392 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 11:08:45,406 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 11:08:45,406 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 11:08:45,406 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 11:08:45,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 11:08:45,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 11:08:45,406 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 11:08:45,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 11:08:45,406 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 11:08:45,414 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 11:08:45,416 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 221 flow [2020-12-09 11:08:45,417 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 221 flow [2020-12-09 11:08:45,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2020-12-09 11:08:45,450 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2020-12-09 11:08:45,450 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 11:08:45,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-12-09 11:08:45,456 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2020-12-09 11:08:45,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:45,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:45,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:45,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:45,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:45,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:45,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:45,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:45,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:45,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:46,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:46,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:46,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:46,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:46,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 11:08:46,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:46,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:46,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:46,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:46,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:46,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:46,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:46,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:46,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:46,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:46,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 11:08:46,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:46,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:46,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 11:08:46,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:47,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:47,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 11:08:47,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:47,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:47,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:47,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:47,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:47,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 11:08:47,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:47,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:47,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:47,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:47,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:47,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:47,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:47,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:47,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:47,377 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 11:08:47,728 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-12-09 11:08:47,840 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 11:08:47,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:47,945 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:47,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:47,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:47,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:47,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:47,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:47,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:47,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:48,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:48,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 11:08:48,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:48,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:48,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:48,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 11:08:48,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,141 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 11:08:48,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:48,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:48,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 11:08:48,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:48,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 11:08:48,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 11:08:48,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 11:08:48,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,321 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 11:08:48,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 11:08:48,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:48,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 11:08:48,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 11:08:49,957 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-09 11:08:50,096 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 11:08:50,423 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-09 11:08:50,561 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 11:08:50,593 INFO L131 LiptonReduction]: Checked pairs total: 6203 [2020-12-09 11:08:50,593 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-12-09 11:08:50,597 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-12-09 11:08:50,640 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1166 states. [2020-12-09 11:08:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states. [2020-12-09 11:08:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 11:08:50,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:50,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 11:08:50,645 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1079434, now seen corresponding path program 1 times [2020-12-09 11:08:50,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:50,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919732763] [2020-12-09 11:08:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:50,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919732763] [2020-12-09 11:08:50,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:50,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 11:08:50,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959106564] [2020-12-09 11:08:50,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:08:50,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:08:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:50,803 INFO L87 Difference]: Start difference. First operand 1166 states. Second operand 3 states. [2020-12-09 11:08:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:50,886 INFO L93 Difference]: Finished difference Result 972 states and 3118 transitions. [2020-12-09 11:08:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:08:50,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 11:08:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:50,907 INFO L225 Difference]: With dead ends: 972 [2020-12-09 11:08:50,907 INFO L226 Difference]: Without dead ends: 792 [2020-12-09 11:08:50,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-12-09 11:08:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-12-09 11:08:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-12-09 11:08:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions. [2020-12-09 11:08:50,997 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 3 [2020-12-09 11:08:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:50,998 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions. [2020-12-09 11:08:50,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:08:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions. [2020-12-09 11:08:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 11:08:50,999 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:50,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:50,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 11:08:51,000 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash -915439721, now seen corresponding path program 1 times [2020-12-09 11:08:51,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994483991] [2020-12-09 11:08:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994483991] [2020-12-09 11:08:51,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 11:08:51,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439059133] [2020-12-09 11:08:51,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:08:51,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:08:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:51,101 INFO L87 Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states. [2020-12-09 11:08:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,117 INFO L93 Difference]: Finished difference Result 784 states and 2462 transitions. [2020-12-09 11:08:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:08:51,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 11:08:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,122 INFO L225 Difference]: With dead ends: 784 [2020-12-09 11:08:51,122 INFO L226 Difference]: Without dead ends: 784 [2020-12-09 11:08:51,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-12-09 11:08:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2020-12-09 11:08:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-12-09 11:08:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 2462 transitions. [2020-12-09 11:08:51,143 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 2462 transitions. Word has length 9 [2020-12-09 11:08:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,144 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 2462 transitions. [2020-12-09 11:08:51,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:08:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 2462 transitions. [2020-12-09 11:08:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 11:08:51,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 11:08:51,146 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1502814662, now seen corresponding path program 1 times [2020-12-09 11:08:51,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143226576] [2020-12-09 11:08:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143226576] [2020-12-09 11:08:51,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 11:08:51,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866660010] [2020-12-09 11:08:51,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:08:51,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:08:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:51,193 INFO L87 Difference]: Start difference. First operand 784 states and 2462 transitions. Second operand 3 states. [2020-12-09 11:08:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,202 INFO L93 Difference]: Finished difference Result 732 states and 2276 transitions. [2020-12-09 11:08:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:08:51,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-09 11:08:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,207 INFO L225 Difference]: With dead ends: 732 [2020-12-09 11:08:51,207 INFO L226 Difference]: Without dead ends: 732 [2020-12-09 11:08:51,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-12-09 11:08:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-12-09 11:08:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-09 11:08:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions. [2020-12-09 11:08:51,225 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 11 [2020-12-09 11:08:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,225 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions. [2020-12-09 11:08:51,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:08:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions. [2020-12-09 11:08:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 11:08:51,226 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 11:08:51,227 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash 696253128, now seen corresponding path program 1 times [2020-12-09 11:08:51,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170257018] [2020-12-09 11:08:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170257018] [2020-12-09 11:08:51,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 11:08:51,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471472325] [2020-12-09 11:08:51,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 11:08:51,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 11:08:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:51,267 INFO L87 Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states. [2020-12-09 11:08:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,275 INFO L93 Difference]: Finished difference Result 692 states and 2134 transitions. [2020-12-09 11:08:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 11:08:51,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-09 11:08:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,280 INFO L225 Difference]: With dead ends: 692 [2020-12-09 11:08:51,280 INFO L226 Difference]: Without dead ends: 692 [2020-12-09 11:08:51,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 11:08:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-12-09 11:08:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2020-12-09 11:08:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-12-09 11:08:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions. [2020-12-09 11:08:51,296 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 11 [2020-12-09 11:08:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,296 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions. [2020-12-09 11:08:51,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 11:08:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions. [2020-12-09 11:08:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 11:08:51,298 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 11:08:51,298 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1061408055, now seen corresponding path program 1 times [2020-12-09 11:08:51,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120913129] [2020-12-09 11:08:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120913129] [2020-12-09 11:08:51,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:08:51,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561976855] [2020-12-09 11:08:51,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:08:51,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:08:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:08:51,351 INFO L87 Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 4 states. [2020-12-09 11:08:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,380 INFO L93 Difference]: Finished difference Result 636 states and 1734 transitions. [2020-12-09 11:08:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 11:08:51,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 11:08:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,383 INFO L225 Difference]: With dead ends: 636 [2020-12-09 11:08:51,383 INFO L226 Difference]: Without dead ends: 456 [2020-12-09 11:08:51,383 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-12-09 11:08:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-12-09 11:08:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2020-12-09 11:08:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-12-09 11:08:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1190 transitions. [2020-12-09 11:08:51,393 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1190 transitions. Word has length 13 [2020-12-09 11:08:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,393 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 1190 transitions. [2020-12-09 11:08:51,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:08:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1190 transitions. [2020-12-09 11:08:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 11:08:51,394 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 11:08:51,394 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1701681759, now seen corresponding path program 1 times [2020-12-09 11:08:51,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340703486] [2020-12-09 11:08:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340703486] [2020-12-09 11:08:51,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:08:51,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957317735] [2020-12-09 11:08:51,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 11:08:51,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 11:08:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:08:51,454 INFO L87 Difference]: Start difference. First operand 456 states and 1190 transitions. Second operand 5 states. [2020-12-09 11:08:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,486 INFO L93 Difference]: Finished difference Result 373 states and 910 transitions. [2020-12-09 11:08:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:08:51,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 11:08:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,488 INFO L225 Difference]: With dead ends: 373 [2020-12-09 11:08:51,489 INFO L226 Difference]: Without dead ends: 293 [2020-12-09 11:08:51,489 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-12-09 11:08:51,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-12-09 11:08:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2020-12-09 11:08:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-12-09 11:08:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 701 transitions. [2020-12-09 11:08:51,495 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 701 transitions. Word has length 16 [2020-12-09 11:08:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,495 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 701 transitions. [2020-12-09 11:08:51,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 11:08:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 701 transitions. [2020-12-09 11:08:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 11:08:51,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 11:08:51,496 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1139389007, now seen corresponding path program 1 times [2020-12-09 11:08:51,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504462767] [2020-12-09 11:08:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504462767] [2020-12-09 11:08:51,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:08:51,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275284901] [2020-12-09 11:08:51,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 11:08:51,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 11:08:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:08:51,629 INFO L87 Difference]: Start difference. First operand 293 states and 701 transitions. Second operand 6 states. [2020-12-09 11:08:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,667 INFO L93 Difference]: Finished difference Result 270 states and 653 transitions. [2020-12-09 11:08:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 11:08:51,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-09 11:08:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,669 INFO L225 Difference]: With dead ends: 270 [2020-12-09 11:08:51,669 INFO L226 Difference]: Without dead ends: 255 [2020-12-09 11:08:51,669 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-12-09 11:08:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-09 11:08:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2020-12-09 11:08:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-12-09 11:08:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 625 transitions. [2020-12-09 11:08:51,674 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 625 transitions. Word has length 19 [2020-12-09 11:08:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,674 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 625 transitions. [2020-12-09 11:08:51,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 11:08:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 625 transitions. [2020-12-09 11:08:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:08:51,675 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 11:08:51,675 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -929190209, now seen corresponding path program 1 times [2020-12-09 11:08:51,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571888417] [2020-12-09 11:08:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571888417] [2020-12-09 11:08:51,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:08:51,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242229101] [2020-12-09 11:08:51,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:08:51,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:08:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:08:51,757 INFO L87 Difference]: Start difference. First operand 255 states and 625 transitions. Second operand 4 states. [2020-12-09 11:08:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,798 INFO L93 Difference]: Finished difference Result 377 states and 908 transitions. [2020-12-09 11:08:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 11:08:51,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-09 11:08:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,801 INFO L225 Difference]: With dead ends: 377 [2020-12-09 11:08:51,801 INFO L226 Difference]: Without dead ends: 330 [2020-12-09 11:08:51,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:08:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-12-09 11:08:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 237. [2020-12-09 11:08:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-12-09 11:08:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 571 transitions. [2020-12-09 11:08:51,810 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 571 transitions. Word has length 23 [2020-12-09 11:08:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,810 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 571 transitions. [2020-12-09 11:08:51,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:08:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 571 transitions. [2020-12-09 11:08:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:08:51,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 11:08:51,811 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash 98635939, now seen corresponding path program 2 times [2020-12-09 11:08:51,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377981282] [2020-12-09 11:08:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377981282] [2020-12-09 11:08:51,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:08:51,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083213841] [2020-12-09 11:08:51,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 11:08:51,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 11:08:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:08:51,889 INFO L87 Difference]: Start difference. First operand 237 states and 571 transitions. Second operand 5 states. [2020-12-09 11:08:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:51,926 INFO L93 Difference]: Finished difference Result 359 states and 854 transitions. [2020-12-09 11:08:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:08:51,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-09 11:08:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:51,927 INFO L225 Difference]: With dead ends: 359 [2020-12-09 11:08:51,927 INFO L226 Difference]: Without dead ends: 175 [2020-12-09 11:08:51,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 11:08:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-09 11:08:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2020-12-09 11:08:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-12-09 11:08:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 395 transitions. [2020-12-09 11:08:51,933 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 395 transitions. Word has length 23 [2020-12-09 11:08:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:51,933 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 395 transitions. [2020-12-09 11:08:51,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 11:08:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 395 transitions. [2020-12-09 11:08:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:08:51,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:51,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:51,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 11:08:51,934 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -752831069, now seen corresponding path program 3 times [2020-12-09 11:08:51,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:51,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436061630] [2020-12-09 11:08:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:51,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436061630] [2020-12-09 11:08:51,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:51,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 11:08:51,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548680296] [2020-12-09 11:08:51,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 11:08:51,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 11:08:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 11:08:51,999 INFO L87 Difference]: Start difference. First operand 175 states and 395 transitions. Second operand 4 states. [2020-12-09 11:08:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:52,012 INFO L93 Difference]: Finished difference Result 222 states and 493 transitions. [2020-12-09 11:08:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 11:08:52,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-09 11:08:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:52,013 INFO L225 Difference]: With dead ends: 222 [2020-12-09 11:08:52,013 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 11:08:52,013 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-12-09 11:08:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 11:08:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-12-09 11:08:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-09 11:08:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 255 transitions. [2020-12-09 11:08:52,016 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 255 transitions. Word has length 23 [2020-12-09 11:08:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:52,016 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 255 transitions. [2020-12-09 11:08:52,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 11:08:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 255 transitions. [2020-12-09 11:08:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:08:52,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:52,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:52,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 11:08:52,017 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:52,017 INFO L82 PathProgramCache]: Analyzing trace with hash 678750795, now seen corresponding path program 4 times [2020-12-09 11:08:52,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:52,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913569398] [2020-12-09 11:08:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:52,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913569398] [2020-12-09 11:08:52,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:52,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 11:08:52,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137607026] [2020-12-09 11:08:52,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 11:08:52,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:52,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 11:08:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 11:08:52,115 INFO L87 Difference]: Start difference. First operand 120 states and 255 transitions. Second operand 5 states. [2020-12-09 11:08:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:52,178 INFO L93 Difference]: Finished difference Result 140 states and 290 transitions. [2020-12-09 11:08:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 11:08:52,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-09 11:08:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:52,180 INFO L225 Difference]: With dead ends: 140 [2020-12-09 11:08:52,180 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 11:08:52,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 11:08:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 11:08:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-12-09 11:08:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-12-09 11:08:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 253 transitions. [2020-12-09 11:08:52,184 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 253 transitions. Word has length 23 [2020-12-09 11:08:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:52,185 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 253 transitions. [2020-12-09 11:08:52,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 11:08:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 253 transitions. [2020-12-09 11:08:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:08:52,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:52,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:52,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 11:08:52,186 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1844002741, now seen corresponding path program 5 times [2020-12-09 11:08:52,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:52,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408190081] [2020-12-09 11:08:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 11:08:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 11:08:52,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408190081] [2020-12-09 11:08:52,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 11:08:52,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 11:08:52,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548931290] [2020-12-09 11:08:52,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 11:08:52,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 11:08:52,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 11:08:52,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 11:08:52,349 INFO L87 Difference]: Start difference. First operand 120 states and 253 transitions. Second operand 7 states. [2020-12-09 11:08:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 11:08:52,464 INFO L93 Difference]: Finished difference Result 134 states and 275 transitions. [2020-12-09 11:08:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 11:08:52,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-09 11:08:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 11:08:52,465 INFO L225 Difference]: With dead ends: 134 [2020-12-09 11:08:52,465 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 11:08:52,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 11:08:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 11:08:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-09 11:08:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 11:08:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 119 transitions. [2020-12-09 11:08:52,467 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 119 transitions. Word has length 23 [2020-12-09 11:08:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 11:08:52,468 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 119 transitions. [2020-12-09 11:08:52,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 11:08:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 119 transitions. [2020-12-09 11:08:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 11:08:52,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 11:08:52,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 11:08:52,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 11:08:52,468 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 11:08:52,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 11:08:52,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1160066325, now seen corresponding path program 6 times [2020-12-09 11:08:52,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 11:08:52,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699939598] [2020-12-09 11:08:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 11:08:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 11:08:52,526 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 11:08:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 11:08:52,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 11:08:52,606 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 11:08:52,606 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 11:08:52,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 11:08:52,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:08:52 BasicIcfg [2020-12-09 11:08:52,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 11:08:52,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 11:08:52,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 11:08:52,667 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 11:08:52,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:08:45" (3/4) ... [2020-12-09 11:08:52,669 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 11:08:52,733 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_569fc1f5-6965-4ecb-bb63-13c50b402c08/bin/utaipan/witness.graphml [2020-12-09 11:08:52,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 11:08:52,734 INFO L168 Benchmark]: Toolchain (without parser) took 9383.66 ms. Allocated memory was 102.8 MB in the beginning and 272.6 MB in the end (delta: 169.9 MB). Free memory was 60.8 MB in the beginning and 109.5 MB in the end (delta: -48.6 MB). Peak memory consumption was 124.2 MB. Max. memory is 16.1 GB. [2020-12-09 11:08:52,734 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 102.8 MB. Free memory is still 78.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 11:08:52,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.30 ms. Allocated memory is still 102.8 MB. Free memory was 60.6 MB in the beginning and 54.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-12-09 11:08:52,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.59 ms. Allocated memory is still 102.8 MB. Free memory was 54.0 MB in the beginning and 51.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 11:08:52,735 INFO L168 Benchmark]: Boogie Preprocessor took 28.80 ms. Allocated memory is still 102.8 MB. Free memory was 51.4 MB in the beginning and 49.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 11:08:52,735 INFO L168 Benchmark]: RCFGBuilder took 1518.28 ms. Allocated memory was 102.8 MB in the beginning and 130.0 MB in the end (delta: 27.3 MB). Free memory was 49.4 MB in the beginning and 75.4 MB in the end (delta: -25.9 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. [2020-12-09 11:08:52,735 INFO L168 Benchmark]: TraceAbstraction took 7369.01 ms. Allocated memory was 130.0 MB in the beginning and 272.6 MB in the end (delta: 142.6 MB). Free memory was 74.3 MB in the beginning and 128.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 88.5 MB. Max. memory is 16.1 GB. [2020-12-09 11:08:52,736 INFO L168 Benchmark]: Witness Printer took 66.20 ms. Allocated memory is still 272.6 MB. Free memory was 128.4 MB in the beginning and 109.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 11:08:52,737 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.12 ms. Allocated memory is still 102.8 MB. Free memory is still 78.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 353.30 ms. Allocated memory is still 102.8 MB. Free memory was 60.6 MB in the beginning and 54.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.59 ms. Allocated memory is still 102.8 MB. Free memory was 54.0 MB in the beginning and 51.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.80 ms. Allocated memory is still 102.8 MB. Free memory was 51.4 MB in the beginning and 49.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1518.28 ms. Allocated memory was 102.8 MB in the beginning and 130.0 MB in the end (delta: 27.3 MB). Free memory was 49.4 MB in the beginning and 75.4 MB in the end (delta: -25.9 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7369.01 ms. Allocated memory was 130.0 MB in the beginning and 272.6 MB in the end (delta: 142.6 MB). Free memory was 74.3 MB in the beginning and 128.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 88.5 MB. Max. memory is 16.1 GB. * Witness Printer took 66.20 ms. Allocated memory is still 272.6 MB. Free memory was 128.4 MB in the beginning and 109.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1334 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 171 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.1s, 111 PlacesBefore, 38 PlacesAfterwards, 103 TransitionsBefore, 29 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 6203 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t74; [L846] FCALL, FORK 0 pthread_create(&t74, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L847] 0 pthread_t t75; [L848] FCALL, FORK 0 pthread_create(&t75, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L849] 0 pthread_t t76; [L850] FCALL, FORK 0 pthread_create(&t76, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 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) [L823] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L823] 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) [L823] 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) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 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 [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 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 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L856] 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) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] 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) [L856] 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) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 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 [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 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 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 365 SDtfs, 322 SDslu, 544 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1166occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 93 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 20845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...