/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/mix026_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 10:53:04,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 10:53:04,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 10:53:04,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 10:53:04,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 10:53:04,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 10:53:04,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 10:53:04,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 10:53:04,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 10:53:04,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 10:53:04,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 10:53:04,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 10:53:04,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 10:53:04,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 10:53:04,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 10:53:05,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 10:53:05,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 10:53:05,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 10:53:05,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 10:53:05,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 10:53:05,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 10:53:05,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 10:53:05,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 10:53:05,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 10:53:05,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 10:53:05,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 10:53:05,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 10:53:05,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 10:53:05,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 10:53:05,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 10:53:05,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 10:53:05,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 10:53:05,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 10:53:05,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 10:53:05,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 10:53:05,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 10:53:05,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 10:53:05,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 10:53:05,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 10:53:05,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 10:53:05,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 10:53:05,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 10:53:05,121 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 10:53:05,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 10:53:05,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 10:53:05,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 10:53:05,127 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 10:53:05,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 10:53:05,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 10:53:05,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 10:53:05,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 10:53:05,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 10:53:05,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 10:53:05,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 10:53:05,129 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 10:53:05,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 10:53:05,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 10:53:05,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 10:53:05,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 10:53:05,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 10:53:05,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 10:53:05,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 10:53:05,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 10:53:05,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 10:53:05,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 10:53:05,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 10:53:05,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 10:53:05,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-12-22 10:53:05,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 10:53:05,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 10:53:05,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 10:53:05,581 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 10:53:05,582 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 10:53:05,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix026_power.opt.i [2020-12-22 10:53:05,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a065538/83e7dc4aff804916944ea325bbb1116c/FLAG51e546001 [2020-12-22 10:53:06,467 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 10:53:06,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026_power.opt.i [2020-12-22 10:53:06,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a065538/83e7dc4aff804916944ea325bbb1116c/FLAG51e546001 [2020-12-22 10:53:06,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a065538/83e7dc4aff804916944ea325bbb1116c [2020-12-22 10:53:06,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 10:53:06,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 10:53:06,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 10:53:06,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 10:53:06,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 10:53:06,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:53:06" (1/1) ... [2020-12-22 10:53:06,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7457c64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:06, skipping insertion in model container [2020-12-22 10:53:06,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:53:06" (1/1) ... [2020-12-22 10:53:06,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 10:53:06,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 10:53:06,939 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026_power.opt.i[993,1006] [2020-12-22 10:53:07,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:53:07,418 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 10:53:07,438 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix026_power.opt.i[993,1006] [2020-12-22 10:53:07,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:53:07,628 INFO L208 MainTranslator]: Completed translation [2020-12-22 10:53:07,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07 WrapperNode [2020-12-22 10:53:07,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 10:53:07,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 10:53:07,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 10:53:07,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 10:53:07,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 10:53:07,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 10:53:07,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 10:53:07,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 10:53:07,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... [2020-12-22 10:53:07,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 10:53:07,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 10:53:07,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 10:53:07,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 10:53:07,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 10:53:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 10:53:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 10:53:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 10:53:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 10:53:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-22 10:53:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-22 10:53:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-22 10:53:07,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-22 10:53:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-22 10:53:07,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-22 10:53:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-22 10:53:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-22 10:53:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 10:53:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 10:53:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 10:53:07,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 10:53:07,963 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 10:53:11,125 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 10:53:11,125 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-22 10:53:11,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:11 BoogieIcfgContainer [2020-12-22 10:53:11,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 10:53:11,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 10:53:11,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 10:53:11,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 10:53:11,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:53:06" (1/3) ... [2020-12-22 10:53:11,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90c7b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:53:11, skipping insertion in model container [2020-12-22 10:53:11,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:07" (2/3) ... [2020-12-22 10:53:11,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90c7b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:53:11, skipping insertion in model container [2020-12-22 10:53:11,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:11" (3/3) ... [2020-12-22 10:53:11,138 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_power.opt.i [2020-12-22 10:53:11,146 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 10:53:11,146 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 10:53:11,152 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 10:53:11,153 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 10:53:11,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,215 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,215 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,215 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,216 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,243 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,243 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,243 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,244 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,244 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,255 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,255 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,255 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,255 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,256 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,256 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,256 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,256 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,256 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,257 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,258 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,259 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,260 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,263 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,268 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,268 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,311 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:11,314 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-22 10:53:11,334 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-22 10:53:11,375 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 10:53:11,375 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 10:53:11,375 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 10:53:11,375 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 10:53:11,375 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 10:53:11,375 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 10:53:11,376 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 10:53:11,376 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 10:53:11,397 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 10:53:11,405 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-22 10:53:11,409 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-22 10:53:11,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2020-12-22 10:53:11,482 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2020-12-22 10:53:11,482 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-22 10:53:11,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-22 10:53:11,493 INFO L116 LiptonReduction]: Number of co-enabled transitions 2638 [2020-12-22 10:53:12,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:12,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:12,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:12,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:12,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:12,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:12,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:12,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:12,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,005 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-22 10:53:13,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:13,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:13,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:13,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:14,408 WARN L197 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-22 10:53:14,580 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-22 10:53:15,426 WARN L197 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-12-22 10:53:15,772 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 10:53:15,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:15,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:15,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:15,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:15,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:15,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:15,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:15,849 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:15,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,093 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,096 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,176 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:16,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:16,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:16,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-22 10:53:16,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:17,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-22 10:53:17,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:18,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:18,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:18,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:18,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:18,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:18,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:18,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:18,277 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:18,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:18,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-22 10:53:18,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:18,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-22 10:53:18,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:19,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:19,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,554 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:19,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:19,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:19,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:19,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:19,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:19,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:19,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:20,260 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-22 10:53:20,528 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-22 10:53:21,330 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-22 10:53:21,449 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-22 10:53:21,560 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-22 10:53:21,929 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-22 10:53:22,057 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-22 10:53:22,184 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-22 10:53:22,310 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-22 10:53:22,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 10:53:22,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:22,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 10:53:22,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 10:53:22,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:53:22,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 10:53:22,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:22,882 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-22 10:53:23,214 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-22 10:53:23,573 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-22 10:53:23,911 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-22 10:53:24,884 WARN L197 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-22 10:53:25,287 WARN L197 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-22 10:53:26,224 WARN L197 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-22 10:53:26,671 WARN L197 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-22 10:53:26,680 INFO L131 LiptonReduction]: Checked pairs total: 7543 [2020-12-22 10:53:26,680 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-12-22 10:53:26,687 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-12-22 10:53:27,000 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3898 states. [2020-12-22 10:53:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states. [2020-12-22 10:53:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-22 10:53:27,009 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:27,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-22 10:53:27,011 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1072685035, now seen corresponding path program 1 times [2020-12-22 10:53:27,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:27,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624334474] [2020-12-22 10:53:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:27,328 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-22 10:53:27,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624334474] [2020-12-22 10:53:27,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:27,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:53:27,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400488423] [2020-12-22 10:53:27,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:27,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:27,358 INFO L87 Difference]: Start difference. First operand 3898 states. Second operand 3 states. [2020-12-22 10:53:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:27,539 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-12-22 10:53:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:27,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-22 10:53:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:27,605 INFO L225 Difference]: With dead ends: 3250 [2020-12-22 10:53:27,605 INFO L226 Difference]: Without dead ends: 2650 [2020-12-22 10:53:27,607 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-22 10:53:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-12-22 10:53:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-12-22 10:53:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-12-22 10:53:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-12-22 10:53:27,881 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 5 [2020-12-22 10:53:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:27,881 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-12-22 10:53:27,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-12-22 10:53:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 10:53:27,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:27,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:27,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 10:53:27,889 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash 500532748, now seen corresponding path program 1 times [2020-12-22 10:53:27,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:27,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215114211] [2020-12-22 10:53:27,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:28,080 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-22 10:53:28,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215114211] [2020-12-22 10:53:28,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:28,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:53:28,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656872072] [2020-12-22 10:53:28,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:28,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:28,084 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-12-22 10:53:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:28,172 INFO L93 Difference]: Finished difference Result 4118 states and 15342 transitions. [2020-12-22 10:53:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:28,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-22 10:53:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:28,212 INFO L225 Difference]: With dead ends: 4118 [2020-12-22 10:53:28,212 INFO L226 Difference]: Without dead ends: 3956 [2020-12-22 10:53:28,213 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-22 10:53:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2020-12-22 10:53:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3608. [2020-12-22 10:53:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3608 states. [2020-12-22 10:53:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 13721 transitions. [2020-12-22 10:53:28,498 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 13721 transitions. Word has length 11 [2020-12-22 10:53:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:28,500 INFO L481 AbstractCegarLoop]: Abstraction has 3608 states and 13721 transitions. [2020-12-22 10:53:28,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 13721 transitions. [2020-12-22 10:53:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-22 10:53:28,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:28,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:28,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 10:53:28,509 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1664416299, now seen corresponding path program 1 times [2020-12-22 10:53:28,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:28,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836368042] [2020-12-22 10:53:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:28,663 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-22 10:53:28,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836368042] [2020-12-22 10:53:28,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:28,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 10:53:28,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230564294] [2020-12-22 10:53:28,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:53:28,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:53:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:53:28,666 INFO L87 Difference]: Start difference. First operand 3608 states and 13721 transitions. Second operand 4 states. [2020-12-22 10:53:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:28,841 INFO L93 Difference]: Finished difference Result 3668 states and 13659 transitions. [2020-12-22 10:53:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 10:53:28,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-22 10:53:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:28,876 INFO L225 Difference]: With dead ends: 3668 [2020-12-22 10:53:28,877 INFO L226 Difference]: Without dead ends: 3668 [2020-12-22 10:53:28,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:53:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2020-12-22 10:53:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3008. [2020-12-22 10:53:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-22 10:53:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 11407 transitions. [2020-12-22 10:53:29,018 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 11407 transitions. Word has length 12 [2020-12-22 10:53:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:29,019 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 11407 transitions. [2020-12-22 10:53:29,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:53:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 11407 transitions. [2020-12-22 10:53:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 10:53:29,022 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:29,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:29,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 10:53:29,022 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:29,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:29,024 INFO L82 PathProgramCache]: Analyzing trace with hash -59968734, now seen corresponding path program 1 times [2020-12-22 10:53:29,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:29,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101158070] [2020-12-22 10:53:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:29,197 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-22 10:53:29,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101158070] [2020-12-22 10:53:29,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:29,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:53:29,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585182633] [2020-12-22 10:53:29,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:53:29,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:53:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:53:29,200 INFO L87 Difference]: Start difference. First operand 3008 states and 11407 transitions. Second operand 4 states. [2020-12-22 10:53:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:29,286 INFO L93 Difference]: Finished difference Result 3042 states and 10428 transitions. [2020-12-22 10:53:29,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:53:29,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-22 10:53:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:29,307 INFO L225 Difference]: With dead ends: 3042 [2020-12-22 10:53:29,307 INFO L226 Difference]: Without dead ends: 2256 [2020-12-22 10:53:29,308 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-22 10:53:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2020-12-22 10:53:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2020-12-22 10:53:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2020-12-22 10:53:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 7655 transitions. [2020-12-22 10:53:29,387 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 7655 transitions. Word has length 13 [2020-12-22 10:53:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:29,388 INFO L481 AbstractCegarLoop]: Abstraction has 2256 states and 7655 transitions. [2020-12-22 10:53:29,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:53:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 7655 transitions. [2020-12-22 10:53:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:53:29,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:29,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:29,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 10:53:29,392 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:29,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:29,392 INFO L82 PathProgramCache]: Analyzing trace with hash 618580347, now seen corresponding path program 1 times [2020-12-22 10:53:29,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:29,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937399664] [2020-12-22 10:53:29,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:29,601 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-22 10:53:29,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937399664] [2020-12-22 10:53:29,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:29,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:53:29,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617743749] [2020-12-22 10:53:29,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:53:29,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:53:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:53:29,603 INFO L87 Difference]: Start difference. First operand 2256 states and 7655 transitions. Second operand 5 states. [2020-12-22 10:53:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:29,712 INFO L93 Difference]: Finished difference Result 1910 states and 5946 transitions. [2020-12-22 10:53:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:53:29,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-22 10:53:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:29,734 INFO L225 Difference]: With dead ends: 1910 [2020-12-22 10:53:29,735 INFO L226 Difference]: Without dead ends: 1428 [2020-12-22 10:53:29,735 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-22 10:53:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-12-22 10:53:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1416. [2020-12-22 10:53:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2020-12-22 10:53:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 4315 transitions. [2020-12-22 10:53:29,839 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 4315 transitions. Word has length 16 [2020-12-22 10:53:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:29,840 INFO L481 AbstractCegarLoop]: Abstraction has 1416 states and 4315 transitions. [2020-12-22 10:53:29,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:53:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 4315 transitions. [2020-12-22 10:53:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:53:29,844 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:29,844 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-22 10:53:29,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 10:53:29,844 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:29,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1458493415, now seen corresponding path program 1 times [2020-12-22 10:53:29,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:29,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985479861] [2020-12-22 10:53:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:29,996 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-22 10:53:29,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985479861] [2020-12-22 10:53:29,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:29,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:53:29,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58492391] [2020-12-22 10:53:29,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:53:29,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:53:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:53:29,999 INFO L87 Difference]: Start difference. First operand 1416 states and 4315 transitions. Second operand 4 states. [2020-12-22 10:53:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:30,101 INFO L93 Difference]: Finished difference Result 2078 states and 6193 transitions. [2020-12-22 10:53:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:53:30,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-22 10:53:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:30,111 INFO L225 Difference]: With dead ends: 2078 [2020-12-22 10:53:30,111 INFO L226 Difference]: Without dead ends: 1882 [2020-12-22 10:53:30,111 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-22 10:53:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-12-22 10:53:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1440. [2020-12-22 10:53:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2020-12-22 10:53:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 4348 transitions. [2020-12-22 10:53:30,161 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 4348 transitions. Word has length 19 [2020-12-22 10:53:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:30,161 INFO L481 AbstractCegarLoop]: Abstraction has 1440 states and 4348 transitions. [2020-12-22 10:53:30,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:53:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 4348 transitions. [2020-12-22 10:53:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:53:30,165 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:30,165 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-22 10:53:30,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 10:53:30,166 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1318865409, now seen corresponding path program 2 times [2020-12-22 10:53:30,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:30,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553774542] [2020-12-22 10:53:30,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:30,256 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-22 10:53:30,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553774542] [2020-12-22 10:53:30,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:30,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:53:30,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315688478] [2020-12-22 10:53:30,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:53:30,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:53:30,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:53:30,264 INFO L87 Difference]: Start difference. First operand 1440 states and 4348 transitions. Second operand 4 states. [2020-12-22 10:53:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:30,308 INFO L93 Difference]: Finished difference Result 1929 states and 5683 transitions. [2020-12-22 10:53:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 10:53:30,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-22 10:53:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:30,328 INFO L225 Difference]: With dead ends: 1929 [2020-12-22 10:53:30,328 INFO L226 Difference]: Without dead ends: 1419 [2020-12-22 10:53:30,329 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-22 10:53:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-12-22 10:53:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1386. [2020-12-22 10:53:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2020-12-22 10:53:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 4098 transitions. [2020-12-22 10:53:30,373 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 4098 transitions. Word has length 19 [2020-12-22 10:53:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:30,373 INFO L481 AbstractCegarLoop]: Abstraction has 1386 states and 4098 transitions. [2020-12-22 10:53:30,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:53:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 4098 transitions. [2020-12-22 10:53:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:53:30,377 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:30,377 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-22 10:53:30,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 10:53:30,378 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash -998725459, now seen corresponding path program 3 times [2020-12-22 10:53:30,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:30,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955902790] [2020-12-22 10:53:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:30,570 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-22 10:53:30,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955902790] [2020-12-22 10:53:30,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:30,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:53:30,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5266472] [2020-12-22 10:53:30,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:53:30,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:30,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:53:30,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:53:30,574 INFO L87 Difference]: Start difference. First operand 1386 states and 4098 transitions. Second operand 6 states. [2020-12-22 10:53:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:30,690 INFO L93 Difference]: Finished difference Result 1209 states and 3541 transitions. [2020-12-22 10:53:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:53:30,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-22 10:53:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:30,696 INFO L225 Difference]: With dead ends: 1209 [2020-12-22 10:53:30,697 INFO L226 Difference]: Without dead ends: 1051 [2020-12-22 10:53:30,698 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-22 10:53:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2020-12-22 10:53:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 985. [2020-12-22 10:53:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2020-12-22 10:53:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2928 transitions. [2020-12-22 10:53:30,732 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2928 transitions. Word has length 19 [2020-12-22 10:53:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:30,732 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 2928 transitions. [2020-12-22 10:53:30,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:53:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2928 transitions. [2020-12-22 10:53:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:53:30,739 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:30,739 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-22 10:53:30,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 10:53:30,740 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 416637619, now seen corresponding path program 1 times [2020-12-22 10:53:30,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:30,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333587968] [2020-12-22 10:53:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:31,162 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-22 10:53:31,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333587968] [2020-12-22 10:53:31,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:31,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:53:31,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609101850] [2020-12-22 10:53:31,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:53:31,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:31,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:53:31,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:53:31,165 INFO L87 Difference]: Start difference. First operand 985 states and 2928 transitions. Second operand 7 states. [2020-12-22 10:53:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:31,446 INFO L93 Difference]: Finished difference Result 1777 states and 5029 transitions. [2020-12-22 10:53:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:53:31,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-22 10:53:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:31,453 INFO L225 Difference]: With dead ends: 1777 [2020-12-22 10:53:31,454 INFO L226 Difference]: Without dead ends: 1475 [2020-12-22 10:53:31,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:53:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-12-22 10:53:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1087. [2020-12-22 10:53:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2020-12-22 10:53:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 3126 transitions. [2020-12-22 10:53:31,490 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 3126 transitions. Word has length 23 [2020-12-22 10:53:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:31,491 INFO L481 AbstractCegarLoop]: Abstraction has 1087 states and 3126 transitions. [2020-12-22 10:53:31,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:53:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 3126 transitions. [2020-12-22 10:53:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:53:31,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:31,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, 1, 1, 1, 1] [2020-12-22 10:53:31,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 10:53:31,495 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1209383703, now seen corresponding path program 2 times [2020-12-22 10:53:31,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:31,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57517550] [2020-12-22 10:53:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:31,972 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-22 10:53:31,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57517550] [2020-12-22 10:53:31,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:31,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:53:31,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077325091] [2020-12-22 10:53:31,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:53:31,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:53:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:53:31,975 INFO L87 Difference]: Start difference. First operand 1087 states and 3126 transitions. Second operand 7 states. [2020-12-22 10:53:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:32,429 INFO L93 Difference]: Finished difference Result 1440 states and 3952 transitions. [2020-12-22 10:53:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:53:32,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-22 10:53:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:32,435 INFO L225 Difference]: With dead ends: 1440 [2020-12-22 10:53:32,435 INFO L226 Difference]: Without dead ends: 1363 [2020-12-22 10:53:32,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:53:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-12-22 10:53:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1121. [2020-12-22 10:53:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2020-12-22 10:53:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 3195 transitions. [2020-12-22 10:53:32,477 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 3195 transitions. Word has length 23 [2020-12-22 10:53:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:32,477 INFO L481 AbstractCegarLoop]: Abstraction has 1121 states and 3195 transitions. [2020-12-22 10:53:32,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:53:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 3195 transitions. [2020-12-22 10:53:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:53:32,482 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:32,482 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-22 10:53:32,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 10:53:32,482 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:32,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:32,483 INFO L82 PathProgramCache]: Analyzing trace with hash -523072331, now seen corresponding path program 3 times [2020-12-22 10:53:32,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:32,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023207233] [2020-12-22 10:53:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:32,636 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-22 10:53:32,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023207233] [2020-12-22 10:53:32,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:32,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:53:32,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995543083] [2020-12-22 10:53:32,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:53:32,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:53:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:53:32,639 INFO L87 Difference]: Start difference. First operand 1121 states and 3195 transitions. Second operand 7 states. [2020-12-22 10:53:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:32,775 INFO L93 Difference]: Finished difference Result 1086 states and 3122 transitions. [2020-12-22 10:53:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:53:32,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-22 10:53:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:32,778 INFO L225 Difference]: With dead ends: 1086 [2020-12-22 10:53:32,779 INFO L226 Difference]: Without dead ends: 534 [2020-12-22 10:53:32,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:53:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-12-22 10:53:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 428. [2020-12-22 10:53:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-12-22 10:53:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1149 transitions. [2020-12-22 10:53:32,797 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1149 transitions. Word has length 23 [2020-12-22 10:53:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:32,797 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 1149 transitions. [2020-12-22 10:53:32,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:53:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1149 transitions. [2020-12-22 10:53:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 10:53:32,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:32,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:32,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 10:53:32,800 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:32,801 INFO L82 PathProgramCache]: Analyzing trace with hash -945062827, now seen corresponding path program 1 times [2020-12-22 10:53:32,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:32,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385148762] [2020-12-22 10:53:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:32,885 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-22 10:53:32,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385148762] [2020-12-22 10:53:32,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:32,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 10:53:32,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604893582] [2020-12-22 10:53:32,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:53:32,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:53:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:53:32,894 INFO L87 Difference]: Start difference. First operand 428 states and 1149 transitions. Second operand 3 states. [2020-12-22 10:53:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:32,915 INFO L93 Difference]: Finished difference Result 672 states and 1816 transitions. [2020-12-22 10:53:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:53:32,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-22 10:53:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:32,918 INFO L225 Difference]: With dead ends: 672 [2020-12-22 10:53:32,918 INFO L226 Difference]: Without dead ends: 324 [2020-12-22 10:53:32,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-22 10:53:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-12-22 10:53:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2020-12-22 10:53:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-22 10:53:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 841 transitions. [2020-12-22 10:53:32,929 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 841 transitions. Word has length 27 [2020-12-22 10:53:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:32,930 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 841 transitions. [2020-12-22 10:53:32,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:53:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 841 transitions. [2020-12-22 10:53:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 10:53:32,933 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:32,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:32,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 10:53:32,934 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash -406249859, now seen corresponding path program 2 times [2020-12-22 10:53:32,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:32,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526427165] [2020-12-22 10:53:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:53:33,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-22 10:53:33,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526427165] [2020-12-22 10:53:33,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:53:33,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:53:33,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211109695] [2020-12-22 10:53:33,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:53:33,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:53:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:53:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:53:33,351 INFO L87 Difference]: Start difference. First operand 324 states and 841 transitions. Second operand 8 states. [2020-12-22 10:53:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:53:33,697 INFO L93 Difference]: Finished difference Result 516 states and 1321 transitions. [2020-12-22 10:53:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:53:33,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-22 10:53:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:53:33,703 INFO L225 Difference]: With dead ends: 516 [2020-12-22 10:53:33,703 INFO L226 Difference]: Without dead ends: 449 [2020-12-22 10:53:33,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:53:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-12-22 10:53:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 308. [2020-12-22 10:53:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-22 10:53:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 789 transitions. [2020-12-22 10:53:33,719 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 789 transitions. Word has length 27 [2020-12-22 10:53:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:53:33,720 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 789 transitions. [2020-12-22 10:53:33,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:53:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 789 transitions. [2020-12-22 10:53:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 10:53:33,722 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:53:33,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:53:33,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 10:53:33,723 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:53:33,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:53:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2042099287, now seen corresponding path program 3 times [2020-12-22 10:53:33,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:53:33,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026990970] [2020-12-22 10:53:33,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:53:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:53:33,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:53:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:53:33,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:53:33,975 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 10:53:33,976 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 10:53:33,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 10:53:34,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 10:53:34 BasicIcfg [2020-12-22 10:53:34,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 10:53:34,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 10:53:34,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 10:53:34,226 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 10:53:34,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:11" (3/4) ... [2020-12-22 10:53:34,233 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 10:53:34,432 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix026_power.opt.i-witness.graphml [2020-12-22 10:53:34,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 10:53:34,433 INFO L168 Benchmark]: Toolchain (without parser) took 27791.50 ms. Allocated memory was 151.0 MB in the beginning and 455.1 MB in the end (delta: 304.1 MB). Free memory was 125.3 MB in the beginning and 358.1 MB in the end (delta: -232.7 MB). Peak memory consumption was 72.4 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:34,434 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 10:53:34,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 979.81 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 121.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:34,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.16 ms. Allocated memory is still 151.0 MB. Free memory was 121.3 MB in the beginning and 118.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:34,437 INFO L168 Benchmark]: Boogie Preprocessor took 74.23 ms. Allocated memory is still 151.0 MB. Free memory was 118.7 MB in the beginning and 116.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:34,438 INFO L168 Benchmark]: RCFGBuilder took 3297.70 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.1 MB in the beginning and 82.6 MB in the end (delta: 33.5 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:34,438 INFO L168 Benchmark]: TraceAbstraction took 23094.15 ms. Allocated memory was 181.4 MB in the beginning and 455.1 MB in the end (delta: 273.7 MB). Free memory was 82.0 MB in the beginning and 381.7 MB in the end (delta: -299.7 MB). Peak memory consumption was 183.7 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:34,439 INFO L168 Benchmark]: Witness Printer took 206.79 ms. Allocated memory is still 455.1 MB. Free memory was 381.7 MB in the beginning and 358.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:53:34,442 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.23 ms. Allocated memory is still 151.0 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 979.81 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 121.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 125.16 ms. Allocated memory is still 151.0 MB. Free memory was 121.3 MB in the beginning and 118.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 74.23 ms. Allocated memory is still 151.0 MB. Free memory was 118.7 MB in the beginning and 116.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3297.70 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.1 MB in the beginning and 82.6 MB in the end (delta: 33.5 MB). Peak memory consumption was 77.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23094.15 ms. Allocated memory was 181.4 MB in the beginning and 455.1 MB in the end (delta: 273.7 MB). Free memory was 82.0 MB in the beginning and 381.7 MB in the end (delta: -299.7 MB). Peak memory consumption was 183.7 MB. Max. memory is 8.0 GB. * Witness Printer took 206.79 ms. Allocated memory is still 455.1 MB. Free memory was 381.7 MB in the beginning and 358.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1680 VarBasedMoverChecksPositive, 97 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 210 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.2s, 128 PlacesBefore, 46 PlacesAfterwards, 117 TransitionsBefore, 33 TransitionsAfterwards, 2638 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 7543 MoverChecksTotal - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L753] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.6s, HoareTripleCheckerStatistics: 543 SDtfs, 611 SDslu, 1048 SDs, 0 SdLazy, 412 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3898occurred 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: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 2438 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 37996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...