/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 16:05:43,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 16:05:43,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 16:05:44,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 16:05:44,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 16:05:44,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 16:05:44,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 16:05:44,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 16:05:44,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 16:05:44,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 16:05:44,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 16:05:44,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 16:05:44,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 16:05:44,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 16:05:44,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 16:05:44,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 16:05:44,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 16:05:44,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 16:05:44,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 16:05:44,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 16:05:44,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 16:05:44,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 16:05:44,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 16:05:44,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 16:05:44,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 16:05:44,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 16:05:44,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 16:05:44,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 16:05:44,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 16:05:44,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 16:05:44,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 16:05:44,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 16:05:44,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 16:05:44,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 16:05:44,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 16:05:44,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 16:05:44,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 16:05:44,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 16:05:44,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 16:05:44,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 16:05:44,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 16:05:44,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-12 16:05:44,085 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 16:05:44,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 16:05:44,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 16:05:44,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 16:05:44,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 16:05:44,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 16:05:44,086 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 16:05:44,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 16:05:44,087 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 16:05:44,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 16:05:44,088 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 16:05:44,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 16:05:44,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 16:05:44,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 16:05:44,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 16:05:44,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 16:05:44,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 16:05:44,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 16:05:44,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 16:05:44,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 16:05:44,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 16:05:44,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 16:05:44,089 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 16:05:44,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 16:05:44,089 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 [2021-06-12 16:05:44,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 16:05:44,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 16:05:44,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 16:05:44,353 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 16:05:44,355 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 16:05:44,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2021-06-12 16:05:44,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07feef1a2/ed4e47c453d44766a97a3eabe89d3503/FLAG92a0a0be1 [2021-06-12 16:05:44,836 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 16:05:44,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2021-06-12 16:05:44,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07feef1a2/ed4e47c453d44766a97a3eabe89d3503/FLAG92a0a0be1 [2021-06-12 16:05:45,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07feef1a2/ed4e47c453d44766a97a3eabe89d3503 [2021-06-12 16:05:45,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 16:05:45,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 16:05:45,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 16:05:45,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 16:05:45,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 16:05:45,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1ea6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45, skipping insertion in model container [2021-06-12 16:05:45,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 16:05:45,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 16:05:45,340 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] [2021-06-12 16:05:45,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:05:45,510 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 16:05:45,517 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] [2021-06-12 16:05:45,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 16:05:45,597 INFO L208 MainTranslator]: Completed translation [2021-06-12 16:05:45,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45 WrapperNode [2021-06-12 16:05:45,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 16:05:45,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 16:05:45,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 16:05:45,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 16:05:45,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 16:05:45,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 16:05:45,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 16:05:45,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 16:05:45,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (1/1) ... [2021-06-12 16:05:45,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 16:05:45,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 16:05:45,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 16:05:45,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 16:05:45,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (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 [2021-06-12 16:05:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 16:05:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 16:05:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 16:05:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 16:05:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 16:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 16:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 16:05:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 16:05:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-12 16:05:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-12 16:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 16:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 16:05:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 16:05:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 16:05:45,794 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 16:05:47,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 16:05:47,291 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 16:05:47,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:05:47 BoogieIcfgContainer [2021-06-12 16:05:47,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 16:05:47,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 16:05:47,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 16:05:47,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 16:05:47,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 04:05:45" (1/3) ... [2021-06-12 16:05:47,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62854c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:05:47, skipping insertion in model container [2021-06-12 16:05:47,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 04:05:45" (2/3) ... [2021-06-12 16:05:47,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62854c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 04:05:47, skipping insertion in model container [2021-06-12 16:05:47,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 04:05:47" (3/3) ... [2021-06-12 16:05:47,297 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2021-06-12 16:05:47,302 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 16:05:47,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 16:05:47,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 16:05:47,302 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 16:05:47,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,355 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,365 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 16:05:47,368 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 16:05:47,383 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:05:47,404 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:05:47,404 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:05:47,404 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:05:47,405 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:05:47,405 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:05:47,405 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:05:47,405 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:05:47,405 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-12 16:05:47,415 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 113 transitions, 241 flow [2021-06-12 16:05:48,744 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:48,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:05:48,922 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-12 16:05:48,923 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 16:05:48,928 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:05:48,928 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:05:48,928 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:05:48,928 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:05:48,928 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:05:48,928 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:05:48,928 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:05:48,928 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork2======== [2021-06-12 16:05:48,931 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 113 transitions, 241 flow [2021-06-12 16:05:49,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-12 16:05:49,798 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:49,798 INFO L472 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, 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] [2021-06-12 16:05:49,798 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1545126973, now seen corresponding path program 1 times [2021-06-12 16:05:49,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:49,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594541609] [2021-06-12 16:05:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:50,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:50,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594541609] [2021-06-12 16:05:50,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594541609] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:50,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:50,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 16:05:50,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637432854] [2021-06-12 16:05:50,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 16:05:50,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 16:05:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:05:50,052 INFO L87 Difference]: Start difference. First operand has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:50,313 INFO L93 Difference]: Finished difference Result 19379 states and 69570 transitions. [2021-06-12 16:05:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 16:05:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-06-12 16:05:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:50,318 INFO L225 Difference]: With dead ends: 19379 [2021-06-12 16:05:50,318 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 16:05:50,319 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 16:05:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 16:05:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 16:05:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 16:05:50,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2021-06-12 16:05:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:50,333 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 16:05:50,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 16:05:50,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 16:05:50,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 16:05:50,334 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork2 was SAFE (2/3) [2021-06-12 16:05:50,335 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-12 16:05:50,335 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 16:05:50,335 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 16:05:50,335 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 16:05:50,335 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 16:05:50,335 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 16:05:50,336 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 16:05:50,336 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 16:05:50,336 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 16:05:50,337 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 113 transitions, 241 flow [2021-06-12 16:05:51,146 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-12 16:05:51,183 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:51,184 INFO L472 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:05:51,184 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:51,184 INFO L82 PathProgramCache]: Analyzing trace with hash -518526821, now seen corresponding path program 1 times [2021-06-12 16:05:51,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:51,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57297091] [2021-06-12 16:05:51,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:51,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:51,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57297091] [2021-06-12 16:05:51,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57297091] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:51,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:51,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:05:51,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938660773] [2021-06-12 16:05:51,380 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:05:51,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:05:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:05:51,407 INFO L87 Difference]: Start difference. First operand has 22099 states, 22095 states have (on average 3.674949083503055) internal successors, (81198), 22098 states have internal predecessors, (81198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:51,705 INFO L93 Difference]: Finished difference Result 26635 states and 95319 transitions. [2021-06-12 16:05:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:05:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-12 16:05:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:51,763 INFO L225 Difference]: With dead ends: 26635 [2021-06-12 16:05:51,763 INFO L226 Difference]: Without dead ends: 9731 [2021-06-12 16:05:51,764 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 77.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:05:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2021-06-12 16:05:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 9731. [2021-06-12 16:05:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9731 states, 9730 states have (on average 3.499280575539568) internal successors, (34048), 9730 states have internal predecessors, (34048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 34048 transitions. [2021-06-12 16:05:52,072 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 34048 transitions. Word has length 71 [2021-06-12 16:05:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:52,073 INFO L482 AbstractCegarLoop]: Abstraction has 9731 states and 34048 transitions. [2021-06-12 16:05:52,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 34048 transitions. [2021-06-12 16:05:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-12 16:05:52,091 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:52,091 INFO L472 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:05:52,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 16:05:52,092 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:52,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:52,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1487871562, now seen corresponding path program 1 times [2021-06-12 16:05:52,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:52,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605100103] [2021-06-12 16:05:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:52,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:52,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605100103] [2021-06-12 16:05:52,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605100103] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:52,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:52,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:05:52,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324310072] [2021-06-12 16:05:52,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:05:52,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:52,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:05:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:05:52,193 INFO L87 Difference]: Start difference. First operand 9731 states and 34048 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:52,395 INFO L93 Difference]: Finished difference Result 10595 states and 36772 transitions. [2021-06-12 16:05:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:05:52,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-12 16:05:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:52,428 INFO L225 Difference]: With dead ends: 10595 [2021-06-12 16:05:52,428 INFO L226 Difference]: Without dead ends: 8867 [2021-06-12 16:05:52,429 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:05:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8867 states. [2021-06-12 16:05:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8867 to 8867. [2021-06-12 16:05:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8867 states, 8866 states have (on average 3.478908188585608) internal successors, (30844), 8866 states have internal predecessors, (30844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 30844 transitions. [2021-06-12 16:05:52,615 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 30844 transitions. Word has length 75 [2021-06-12 16:05:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:52,615 INFO L482 AbstractCegarLoop]: Abstraction has 8867 states and 30844 transitions. [2021-06-12 16:05:52,615 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 30844 transitions. [2021-06-12 16:05:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-12 16:05:52,629 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:52,629 INFO L472 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:05:52,629 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 16:05:52,629 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash 298698210, now seen corresponding path program 1 times [2021-06-12 16:05:52,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:52,630 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526687897] [2021-06-12 16:05:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:52,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:52,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526687897] [2021-06-12 16:05:52,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526687897] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:52,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:52,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 16:05:52,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115975153] [2021-06-12 16:05:52,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 16:05:52,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 16:05:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-12 16:05:52,815 INFO L87 Difference]: Start difference. First operand 8867 states and 30844 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:53,146 INFO L93 Difference]: Finished difference Result 10475 states and 36292 transitions. [2021-06-12 16:05:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 16:05:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-12 16:05:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:53,173 INFO L225 Difference]: With dead ends: 10475 [2021-06-12 16:05:53,173 INFO L226 Difference]: Without dead ends: 9227 [2021-06-12 16:05:53,174 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 143.3ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-12 16:05:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2021-06-12 16:05:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9227. [2021-06-12 16:05:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9227 states, 9226 states have (on average 3.4823325384782136) internal successors, (32128), 9226 states have internal predecessors, (32128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9227 states to 9227 states and 32128 transitions. [2021-06-12 16:05:53,373 INFO L78 Accepts]: Start accepts. Automaton has 9227 states and 32128 transitions. Word has length 78 [2021-06-12 16:05:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:53,373 INFO L482 AbstractCegarLoop]: Abstraction has 9227 states and 32128 transitions. [2021-06-12 16:05:53,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9227 states and 32128 transitions. [2021-06-12 16:05:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 16:05:53,387 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:53,387 INFO L472 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, 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, 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] [2021-06-12 16:05:53,387 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 16:05:53,387 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 466645121, now seen corresponding path program 1 times [2021-06-12 16:05:53,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:53,388 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662812919] [2021-06-12 16:05:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:53,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:53,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662812919] [2021-06-12 16:05:53,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662812919] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:53,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:53,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 16:05:53,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091287207] [2021-06-12 16:05:53,540 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 16:05:53,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 16:05:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-12 16:05:53,541 INFO L87 Difference]: Start difference. First operand 9227 states and 32128 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:54,022 INFO L93 Difference]: Finished difference Result 10695 states and 37060 transitions. [2021-06-12 16:05:54,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-12 16:05:54,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-12 16:05:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:54,048 INFO L225 Difference]: With dead ends: 10695 [2021-06-12 16:05:54,048 INFO L226 Difference]: Without dead ends: 9687 [2021-06-12 16:05:54,049 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 283.9ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-06-12 16:05:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2021-06-12 16:05:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 9687. [2021-06-12 16:05:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9687 states, 9686 states have (on average 3.48420400578154) internal successors, (33748), 9686 states have internal predecessors, (33748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9687 states to 9687 states and 33748 transitions. [2021-06-12 16:05:54,281 INFO L78 Accepts]: Start accepts. Automaton has 9687 states and 33748 transitions. Word has length 80 [2021-06-12 16:05:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:54,282 INFO L482 AbstractCegarLoop]: Abstraction has 9687 states and 33748 transitions. [2021-06-12 16:05:54,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9687 states and 33748 transitions. [2021-06-12 16:05:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 16:05:54,299 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:54,299 INFO L472 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, 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, 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] [2021-06-12 16:05:54,299 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 16:05:54,299 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash -535924927, now seen corresponding path program 1 times [2021-06-12 16:05:54,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:54,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595435194] [2021-06-12 16:05:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:54,436 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:54,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595435194] [2021-06-12 16:05:54,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595435194] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:54,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:54,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:05:54,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017682124] [2021-06-12 16:05:54,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:05:54,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:54,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:05:54,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:05:54,439 INFO L87 Difference]: Start difference. First operand 9687 states and 33748 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:54,565 INFO L93 Difference]: Finished difference Result 14487 states and 50095 transitions. [2021-06-12 16:05:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 16:05:54,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-12 16:05:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:54,595 INFO L225 Difference]: With dead ends: 14487 [2021-06-12 16:05:54,595 INFO L226 Difference]: Without dead ends: 10839 [2021-06-12 16:05:54,596 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:05:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10839 states. [2021-06-12 16:05:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10839 to 9579. [2021-06-12 16:05:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 9578 states have (on average 3.4097932762580916) internal successors, (32659), 9578 states have internal predecessors, (32659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 32659 transitions. [2021-06-12 16:05:54,834 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 32659 transitions. Word has length 80 [2021-06-12 16:05:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:54,834 INFO L482 AbstractCegarLoop]: Abstraction has 9579 states and 32659 transitions. [2021-06-12 16:05:54,834 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 32659 transitions. [2021-06-12 16:05:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-12 16:05:54,849 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:54,850 INFO L472 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, 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, 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] [2021-06-12 16:05:54,850 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 16:05:54,850 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash -369531933, now seen corresponding path program 2 times [2021-06-12 16:05:54,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:54,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300009027] [2021-06-12 16:05:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:54,938 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:54,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300009027] [2021-06-12 16:05:54,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300009027] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:54,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:54,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 16:05:54,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472098431] [2021-06-12 16:05:54,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 16:05:54,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 16:05:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 16:05:54,939 INFO L87 Difference]: Start difference. First operand 9579 states and 32659 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:55,056 INFO L93 Difference]: Finished difference Result 10875 states and 36313 transitions. [2021-06-12 16:05:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 16:05:55,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-12 16:05:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:55,073 INFO L225 Difference]: With dead ends: 10875 [2021-06-12 16:05:55,073 INFO L226 Difference]: Without dead ends: 7707 [2021-06-12 16:05:55,074 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:05:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7707 states. [2021-06-12 16:05:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7707 to 7707. [2021-06-12 16:05:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7707 states, 7706 states have (on average 3.310407474695043) internal successors, (25510), 7706 states have internal predecessors, (25510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7707 states to 7707 states and 25510 transitions. [2021-06-12 16:05:55,228 INFO L78 Accepts]: Start accepts. Automaton has 7707 states and 25510 transitions. Word has length 80 [2021-06-12 16:05:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:55,228 INFO L482 AbstractCegarLoop]: Abstraction has 7707 states and 25510 transitions. [2021-06-12 16:05:55,228 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7707 states and 25510 transitions. [2021-06-12 16:05:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-12 16:05:55,240 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:55,240 INFO L472 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, 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, 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] [2021-06-12 16:05:55,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 16:05:55,240 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:55,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -491541785, now seen corresponding path program 1 times [2021-06-12 16:05:55,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:55,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123572503] [2021-06-12 16:05:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:55,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:55,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123572503] [2021-06-12 16:05:55,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123572503] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:55,318 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:55,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:05:55,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590545392] [2021-06-12 16:05:55,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:05:55,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:55,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:05:55,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:05:55,320 INFO L87 Difference]: Start difference. First operand 7707 states and 25510 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:55,462 INFO L93 Difference]: Finished difference Result 7149 states and 23029 transitions. [2021-06-12 16:05:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 16:05:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-12 16:05:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:55,471 INFO L225 Difference]: With dead ends: 7149 [2021-06-12 16:05:55,471 INFO L226 Difference]: Without dead ends: 4953 [2021-06-12 16:05:55,472 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 16:05:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2021-06-12 16:05:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 4709. [2021-06-12 16:05:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4709 states, 4708 states have (on average 3.157604078164826) internal successors, (14866), 4708 states have internal predecessors, (14866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 14866 transitions. [2021-06-12 16:05:55,548 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 14866 transitions. Word has length 81 [2021-06-12 16:05:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:55,548 INFO L482 AbstractCegarLoop]: Abstraction has 4709 states and 14866 transitions. [2021-06-12 16:05:55,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 14866 transitions. [2021-06-12 16:05:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-12 16:05:55,554 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:55,554 INFO L472 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, 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, 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, 1, 1, 1] [2021-06-12 16:05:55,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 16:05:55,554 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:55,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1586207388, now seen corresponding path program 1 times [2021-06-12 16:05:55,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:55,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046751045] [2021-06-12 16:05:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:55,654 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:55,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046751045] [2021-06-12 16:05:55,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046751045] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:55,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:55,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 16:05:55,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630794696] [2021-06-12 16:05:55,655 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 16:05:55,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 16:05:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 16:05:55,655 INFO L87 Difference]: Start difference. First operand 4709 states and 14866 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:55,768 INFO L93 Difference]: Finished difference Result 3899 states and 12121 transitions. [2021-06-12 16:05:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 16:05:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-12 16:05:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:55,772 INFO L225 Difference]: With dead ends: 3899 [2021-06-12 16:05:55,772 INFO L226 Difference]: Without dead ends: 2303 [2021-06-12 16:05:55,773 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 83.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-12 16:05:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2021-06-12 16:05:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2303. [2021-06-12 16:05:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2302 states have (on average 2.9943527367506517) internal successors, (6893), 2302 states have internal predecessors, (6893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 6893 transitions. [2021-06-12 16:05:55,804 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 6893 transitions. Word has length 84 [2021-06-12 16:05:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:55,805 INFO L482 AbstractCegarLoop]: Abstraction has 2303 states and 6893 transitions. [2021-06-12 16:05:55,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 6893 transitions. [2021-06-12 16:05:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-12 16:05:55,807 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:55,807 INFO L472 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:05:55,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 16:05:55,808 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1366858122, now seen corresponding path program 1 times [2021-06-12 16:05:55,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:55,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678288270] [2021-06-12 16:05:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 16:05:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 16:05:55,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 16:05:55,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678288270] [2021-06-12 16:05:55,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678288270] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 16:05:55,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 16:05:55,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 16:05:55,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290588746] [2021-06-12 16:05:55,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 16:05:55,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 16:05:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 16:05:55,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 16:05:55,925 INFO L87 Difference]: Start difference. First operand 2303 states and 6893 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 16:05:55,995 INFO L93 Difference]: Finished difference Result 3023 states and 9098 transitions. [2021-06-12 16:05:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 16:05:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-12 16:05:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 16:05:55,997 INFO L225 Difference]: With dead ends: 3023 [2021-06-12 16:05:55,997 INFO L226 Difference]: Without dead ends: 1301 [2021-06-12 16:05:55,998 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 16:05:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2021-06-12 16:05:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1301. [2021-06-12 16:05:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1300 states have (on average 2.9023076923076925) internal successors, (3773), 1300 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 3773 transitions. [2021-06-12 16:05:56,018 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 3773 transitions. Word has length 89 [2021-06-12 16:05:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 16:05:56,018 INFO L482 AbstractCegarLoop]: Abstraction has 1301 states and 3773 transitions. [2021-06-12 16:05:56,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 16:05:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 3773 transitions. [2021-06-12 16:05:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-12 16:05:56,020 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 16:05:56,020 INFO L472 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 16:05:56,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 16:05:56,020 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 16:05:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 16:05:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash -528868598, now seen corresponding path program 2 times [2021-06-12 16:05:56,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 16:05:56,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420124380] [2021-06-12 16:05:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 16:05:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:05:56,052 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:05:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 16:05:56,087 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 16:05:56,126 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 16:05:56,126 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 16:05:56,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 16:05:56,127 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-12 16:05:56,128 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 16:05:56,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 04:05:56 BasicIcfg [2021-06-12 16:05:56,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 16:05:56,234 INFO L168 Benchmark]: Toolchain (without parser) took 11059.98 ms. Allocated memory was 200.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 163.1 MB in the beginning and 936.2 MB in the end (delta: -773.1 MB). Peak memory consumption was 520.4 MB. Max. memory is 8.0 GB. [2021-06-12 16:05:56,234 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 200.3 MB. Free memory is still 181.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 16:05:56,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.13 ms. Allocated memory is still 200.3 MB. Free memory was 162.9 MB in the beginning and 158.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-12 16:05:56,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.74 ms. Allocated memory is still 200.3 MB. Free memory was 158.1 MB in the beginning and 155.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 16:05:56,235 INFO L168 Benchmark]: Boogie Preprocessor took 58.41 ms. Allocated memory is still 200.3 MB. Free memory was 155.1 MB in the beginning and 153.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 16:05:56,235 INFO L168 Benchmark]: RCFGBuilder took 1556.64 ms. Allocated memory was 200.3 MB in the beginning and 241.2 MB in the end (delta: 40.9 MB). Free memory was 153.0 MB in the beginning and 144.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 84.0 MB. Max. memory is 8.0 GB. [2021-06-12 16:05:56,235 INFO L168 Benchmark]: TraceAbstraction took 8939.87 ms. Allocated memory was 241.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 144.0 MB in the beginning and 936.2 MB in the end (delta: -792.2 MB). Peak memory consumption was 459.3 MB. Max. memory is 8.0 GB. [2021-06-12 16:05:56,236 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 200.3 MB. Free memory is still 181.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 421.13 ms. Allocated memory is still 200.3 MB. Free memory was 162.9 MB in the beginning and 158.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 77.74 ms. Allocated memory is still 200.3 MB. Free memory was 158.1 MB in the beginning and 155.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.41 ms. Allocated memory is still 200.3 MB. Free memory was 155.1 MB in the beginning and 153.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1556.64 ms. Allocated memory was 200.3 MB in the beginning and 241.2 MB in the end (delta: 40.9 MB). Free memory was 153.0 MB in the beginning and 144.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 84.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8939.87 ms. Allocated memory was 241.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 144.0 MB in the beginning and 936.2 MB in the end (delta: -792.2 MB). Peak memory consumption was 459.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L725] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L726] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L727] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L728] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L735] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L736] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L737] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L738] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L739] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t299; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t301; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 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) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] 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) [L813] 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) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 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 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 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 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 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) [L790] 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) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 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 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 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 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L846] 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) [L846] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L846] 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) [L846] 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) [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 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 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L850] 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 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1518.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 176.5ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1339.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=22099occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1406.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 32.9ms, AutomataDifference: 301.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 836.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 101 SDtfs, 43 SDslu, 78 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=22099occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.9ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.4ms SsaConstructionTime, 27.8ms SatisfiabilityAnalysisTime, 126.6ms InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 95 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5791.2ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 134.4ms, AutomataDifference: 2125.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 810.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1378 SDtfs, 1908 SDslu, 5194 SDs, 0 SdLazy, 591 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 493.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 929.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=22099occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1444.7ms AutomataMinimizationTime, 9 MinimizatonAttempts, 1504 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 27.5ms SsaConstructionTime, 335.1ms SatisfiabilityAnalysisTime, 774.4ms InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 2883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...