/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:10:45,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:10:45,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:10:45,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:10:45,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:10:45,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:10:45,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:10:45,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:10:45,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:10:45,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:10:45,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:10:45,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:10:45,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:10:45,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:10:45,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:10:45,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:10:45,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:10:45,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:10:45,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:10:45,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:10:45,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:10:45,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:10:45,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:10:45,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:10:45,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:10:45,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:10:45,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:10:45,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:10:45,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:10:45,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:10:45,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:10:45,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:10:45,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:10:45,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:10:45,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:10:45,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:10:45,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:10:45,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:10:45,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:10:45,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:10:45,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:10:45,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:10:45,178 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:10:45,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:10:45,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:10:45,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:10:45,181 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:10:45,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:10:45,182 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:10:45,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:10:45,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:10:45,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:10:45,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:10:45,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:10:45,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:10:45,184 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:10:45,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:10:45,185 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:10:45,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:10:45,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:10:45,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:10:45,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:10:45,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:10:45,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:10:45,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:10:45,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:10:45,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:10:45,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:10:45,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:10:45,188 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:10:45,188 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:10:45,188 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:10:45,188 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:10:45,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:10:45,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:10:45,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:10:45,522 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:10:45,523 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:10:45,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2020-10-22 02:10:45,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c403e387a/e121d01f9e754c5bb10a7d9909da152c/FLAGbbf5d9b4e [2020-10-22 02:10:46,181 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:10:46,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2020-10-22 02:10:46,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c403e387a/e121d01f9e754c5bb10a7d9909da152c/FLAGbbf5d9b4e [2020-10-22 02:10:46,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c403e387a/e121d01f9e754c5bb10a7d9909da152c [2020-10-22 02:10:46,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:10:46,416 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:10:46,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:10:46,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:10:46,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:10:46,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:10:46" (1/1) ... [2020-10-22 02:10:46,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333b738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:46, skipping insertion in model container [2020-10-22 02:10:46,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:10:46" (1/1) ... [2020-10-22 02:10:46,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:10:46,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:10:47,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:10:47,150 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:10:47,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:10:47,362 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:10:47,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47 WrapperNode [2020-10-22 02:10:47,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:10:47,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:10:47,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:10:47,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:10:47,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:10:47,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:10:47,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:10:47,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:10:47,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... [2020-10-22 02:10:47,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:10:47,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:10:47,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:10:47,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:10:47,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:10:47,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 02:10:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:10:47,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:10:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:10:47,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:10:47,581 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:10:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:10:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:10:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:10:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:10:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:10:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:10:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:10:47,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:10:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:10:47,587 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:10:51,217 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:10:51,217 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-22 02:10:51,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:10:51 BoogieIcfgContainer [2020-10-22 02:10:51,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:10:51,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:10:51,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:10:51,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:10:51,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:10:46" (1/3) ... [2020-10-22 02:10:51,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25adc40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:10:51, skipping insertion in model container [2020-10-22 02:10:51,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:47" (2/3) ... [2020-10-22 02:10:51,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25adc40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:10:51, skipping insertion in model container [2020-10-22 02:10:51,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:10:51" (3/3) ... [2020-10-22 02:10:51,231 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_rmo.oepc.i [2020-10-22 02:10:51,249 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:10:51,249 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:10:51,260 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-22 02:10:51,262 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:10:51,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,330 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,331 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,333 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:51,381 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:10:51,402 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-22 02:10:51,430 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:10:51,431 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:10:51,431 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:10:51,431 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:10:51,431 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:10:51,432 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:10:51,432 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:10:51,432 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:10:51,451 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:10:51,452 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-22 02:10:51,456 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-22 02:10:51,459 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2020-10-22 02:10:51,529 INFO L129 PetriNetUnfolder]: 3/114 cut-off events. [2020-10-22 02:10:51,529 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:10:51,535 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-22 02:10:51,539 INFO L116 LiptonReduction]: Number of co-enabled transitions 1658 [2020-10-22 02:10:53,004 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-10-22 02:10:53,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-22 02:10:53,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:53,923 WARN L193 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 110 [2020-10-22 02:10:54,428 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-22 02:10:54,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-22 02:10:54,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:54,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:10:54,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:54,572 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-22 02:10:56,333 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 298 DAG size of output: 257 [2020-10-22 02:10:56,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-22 02:10:56,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:56,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term [2020-10-22 02:10:56,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-22 02:10:56,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 2, 2, 1] term [2020-10-22 02:10:56,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-22 02:10:56,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:56,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:56,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:56,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:56,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:56,389 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-22 02:10:56,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:10:56,399 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-22 02:10:58,242 WARN L193 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 208 DAG size of output: 185 [2020-10-22 02:10:59,509 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-22 02:10:59,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-22 02:10:59,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 02:11:00,181 WARN L193 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2020-10-22 02:11:00,478 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-22 02:11:00,600 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-22 02:11:01,604 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-22 02:11:01,713 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-10-22 02:11:03,096 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 188 DAG size of output: 160 [2020-10-22 02:11:03,734 WARN L193 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-10-22 02:11:05,445 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 196 DAG size of output: 184 [2020-10-22 02:11:06,213 WARN L193 SmtUtils]: Spent 762.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2020-10-22 02:11:07,839 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 188 [2020-10-22 02:11:08,641 WARN L193 SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-10-22 02:11:09,086 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-10-22 02:11:09,270 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-22 02:11:10,032 WARN L193 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-10-22 02:11:10,778 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-10-22 02:11:11,600 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 157 [2020-10-22 02:11:12,020 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-10-22 02:11:12,054 INFO L131 LiptonReduction]: Checked pairs total: 4346 [2020-10-22 02:11:12,054 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-10-22 02:11:12,069 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 24 transitions, 63 flow [2020-10-22 02:11:12,126 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 550 states. [2020-10-22 02:11:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states. [2020-10-22 02:11:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:11:12,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:12,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:12,143 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1574508146, now seen corresponding path program 1 times [2020-10-22 02:11:12,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:12,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260599309] [2020-10-22 02:11:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:12,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260599309] [2020-10-22 02:11:12,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:12,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:11:12,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712940210] [2020-10-22 02:11:12,520 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:12,524 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:12,540 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:11:12,540 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:12,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:12,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:11:12,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:12,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:11:12,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:12,562 INFO L87 Difference]: Start difference. First operand 550 states. Second operand 3 states. [2020-10-22 02:11:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:12,627 INFO L93 Difference]: Finished difference Result 540 states and 1655 transitions. [2020-10-22 02:11:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:11:12,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:11:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:12,648 INFO L225 Difference]: With dead ends: 540 [2020-10-22 02:11:12,648 INFO L226 Difference]: Without dead ends: 440 [2020-10-22 02:11:12,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-22 02:11:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-22 02:11:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-22 02:11:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-22 02:11:12,742 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-22 02:11:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:12,743 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-22 02:11:12,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:11:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-22 02:11:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:11:12,746 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:12,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:12,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:11:12,746 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1590801371, now seen corresponding path program 1 times [2020-10-22 02:11:12,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:12,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114694282] [2020-10-22 02:11:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:12,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114694282] [2020-10-22 02:11:12,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:12,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:11:12,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [792806910] [2020-10-22 02:11:12,875 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:12,877 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:12,881 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-22 02:11:12,881 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:12,983 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:12,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:11:12,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:12,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:11:12,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:11:12,986 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-10-22 02:11:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:13,037 INFO L93 Difference]: Finished difference Result 422 states and 1257 transitions. [2020-10-22 02:11:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:11:13,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 02:11:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:13,044 INFO L225 Difference]: With dead ends: 422 [2020-10-22 02:11:13,044 INFO L226 Difference]: Without dead ends: 422 [2020-10-22 02:11:13,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:11:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-22 02:11:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2020-10-22 02:11:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-22 02:11:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1257 transitions. [2020-10-22 02:11:13,106 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1257 transitions. Word has length 10 [2020-10-22 02:11:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:13,109 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1257 transitions. [2020-10-22 02:11:13,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:11:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1257 transitions. [2020-10-22 02:11:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:11:13,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:13,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:13,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:11:13,116 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:13,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2070202483, now seen corresponding path program 1 times [2020-10-22 02:11:13,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:13,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804900565] [2020-10-22 02:11:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:13,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804900565] [2020-10-22 02:11:13,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:13,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:11:13,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1838748225] [2020-10-22 02:11:13,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:13,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:13,354 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions. [2020-10-22 02:11:13,354 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:13,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:13,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:11:13,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:13,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:11:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:13,541 INFO L87 Difference]: Start difference. First operand 422 states and 1257 transitions. Second operand 3 states. [2020-10-22 02:11:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:13,592 INFO L93 Difference]: Finished difference Result 406 states and 1201 transitions. [2020-10-22 02:11:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:11:13,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:11:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:13,598 INFO L225 Difference]: With dead ends: 406 [2020-10-22 02:11:13,598 INFO L226 Difference]: Without dead ends: 406 [2020-10-22 02:11:13,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-10-22 02:11:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2020-10-22 02:11:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-10-22 02:11:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1201 transitions. [2020-10-22 02:11:13,616 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1201 transitions. Word has length 11 [2020-10-22 02:11:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:13,616 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 1201 transitions. [2020-10-22 02:11:13,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:11:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1201 transitions. [2020-10-22 02:11:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:11:13,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:13,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:13,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:11:13,619 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -17054494, now seen corresponding path program 1 times [2020-10-22 02:11:13,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:13,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803270907] [2020-10-22 02:11:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:13,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803270907] [2020-10-22 02:11:13,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:13,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:11:13,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732544899] [2020-10-22 02:11:13,686 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:13,689 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:13,695 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 26 transitions. [2020-10-22 02:11:13,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:13,705 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:13,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:11:13,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:11:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:13,706 INFO L87 Difference]: Start difference. First operand 406 states and 1201 transitions. Second operand 3 states. [2020-10-22 02:11:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:13,730 INFO L93 Difference]: Finished difference Result 566 states and 1601 transitions. [2020-10-22 02:11:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:11:13,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 02:11:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:13,735 INFO L225 Difference]: With dead ends: 566 [2020-10-22 02:11:13,736 INFO L226 Difference]: Without dead ends: 430 [2020-10-22 02:11:13,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:11:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-10-22 02:11:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 398. [2020-10-22 02:11:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-22 02:11:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1107 transitions. [2020-10-22 02:11:13,751 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1107 transitions. Word has length 12 [2020-10-22 02:11:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:13,751 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1107 transitions. [2020-10-22 02:11:13,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:11:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1107 transitions. [2020-10-22 02:11:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:11:13,753 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:13,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:13,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:11:13,754 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -159059935, now seen corresponding path program 1 times [2020-10-22 02:11:13,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:13,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016790570] [2020-10-22 02:11:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:14,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016790570] [2020-10-22 02:11:14,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:14,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:11:14,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [118174] [2020-10-22 02:11:14,099 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:14,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:14,112 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-10-22 02:11:14,112 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:14,296 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:14,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:11:14,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:11:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:11:14,298 INFO L87 Difference]: Start difference. First operand 398 states and 1107 transitions. Second operand 6 states. [2020-10-22 02:11:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:14,663 INFO L93 Difference]: Finished difference Result 498 states and 1381 transitions. [2020-10-22 02:11:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:11:14,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-22 02:11:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:14,669 INFO L225 Difference]: With dead ends: 498 [2020-10-22 02:11:14,669 INFO L226 Difference]: Without dead ends: 498 [2020-10-22 02:11:14,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-10-22 02:11:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 430. [2020-10-22 02:11:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-22 02:11:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1180 transitions. [2020-10-22 02:11:14,686 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1180 transitions. Word has length 12 [2020-10-22 02:11:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:14,686 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1180 transitions. [2020-10-22 02:11:14,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:11:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1180 transitions. [2020-10-22 02:11:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:11:14,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:14,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:14,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:11:14,691 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash -159099925, now seen corresponding path program 2 times [2020-10-22 02:11:14,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:14,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576602928] [2020-10-22 02:11:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:15,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576602928] [2020-10-22 02:11:15,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:15,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:11:15,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [763397579] [2020-10-22 02:11:15,016 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:15,022 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:15,027 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-22 02:11:15,027 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:15,423 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:15,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:11:15,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:11:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:11:15,424 INFO L87 Difference]: Start difference. First operand 430 states and 1180 transitions. Second operand 6 states. [2020-10-22 02:11:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:15,566 INFO L93 Difference]: Finished difference Result 467 states and 1281 transitions. [2020-10-22 02:11:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:11:15,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-22 02:11:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:15,571 INFO L225 Difference]: With dead ends: 467 [2020-10-22 02:11:15,572 INFO L226 Difference]: Without dead ends: 467 [2020-10-22 02:11:15,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:11:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-10-22 02:11:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 443. [2020-10-22 02:11:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-22 02:11:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1224 transitions. [2020-10-22 02:11:15,587 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1224 transitions. Word has length 12 [2020-10-22 02:11:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:15,587 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 1224 transitions. [2020-10-22 02:11:15,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:11:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1224 transitions. [2020-10-22 02:11:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:11:15,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:15,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:15,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:11:15,589 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash -635892156, now seen corresponding path program 1 times [2020-10-22 02:11:15,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:15,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489652885] [2020-10-22 02:11:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:16,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489652885] [2020-10-22 02:11:16,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:16,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:11:16,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1792144826] [2020-10-22 02:11:16,030 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:16,033 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:16,037 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-10-22 02:11:16,037 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:16,115 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 3 conjuncts [2020-10-22 02:11:16,307 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:16,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:11:16,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:11:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:16,309 INFO L87 Difference]: Start difference. First operand 443 states and 1224 transitions. Second operand 8 states. [2020-10-22 02:11:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:16,806 INFO L93 Difference]: Finished difference Result 698 states and 1903 transitions. [2020-10-22 02:11:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:11:16,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-22 02:11:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:16,812 INFO L225 Difference]: With dead ends: 698 [2020-10-22 02:11:16,812 INFO L226 Difference]: Without dead ends: 506 [2020-10-22 02:11:16,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:11:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-10-22 02:11:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 443. [2020-10-22 02:11:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-22 02:11:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1206 transitions. [2020-10-22 02:11:16,828 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1206 transitions. Word has length 13 [2020-10-22 02:11:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:16,828 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 1206 transitions. [2020-10-22 02:11:16,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:11:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1206 transitions. [2020-10-22 02:11:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:11:16,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:16,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:16,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:11:16,830 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash 894693664, now seen corresponding path program 2 times [2020-10-22 02:11:16,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:16,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067148410] [2020-10-22 02:11:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:17,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067148410] [2020-10-22 02:11:17,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:17,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:11:17,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [880949294] [2020-10-22 02:11:17,078 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:17,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:17,085 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-10-22 02:11:17,085 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:17,103 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-10-22 02:11:17,332 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:17,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:11:17,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:17,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:11:17,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:17,333 INFO L87 Difference]: Start difference. First operand 443 states and 1206 transitions. Second operand 8 states. [2020-10-22 02:11:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:17,672 INFO L93 Difference]: Finished difference Result 578 states and 1528 transitions. [2020-10-22 02:11:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:11:17,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-22 02:11:17,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:17,676 INFO L225 Difference]: With dead ends: 578 [2020-10-22 02:11:17,677 INFO L226 Difference]: Without dead ends: 322 [2020-10-22 02:11:17,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:11:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-10-22 02:11:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 311. [2020-10-22 02:11:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-10-22 02:11:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 803 transitions. [2020-10-22 02:11:17,687 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 803 transitions. Word has length 13 [2020-10-22 02:11:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:17,687 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 803 transitions. [2020-10-22 02:11:17,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:11:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 803 transitions. [2020-10-22 02:11:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:11:17,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:17,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:17,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:11:17,689 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash -603535568, now seen corresponding path program 1 times [2020-10-22 02:11:17,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:17,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175058690] [2020-10-22 02:11:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:18,163 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2020-10-22 02:11:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:18,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175058690] [2020-10-22 02:11:18,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:18,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:11:18,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1249715025] [2020-10-22 02:11:18,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:18,170 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:18,174 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 24 transitions. [2020-10-22 02:11:18,174 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:18,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:18,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:11:18,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:18,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:11:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:18,396 INFO L87 Difference]: Start difference. First operand 311 states and 803 transitions. Second operand 8 states. [2020-10-22 02:11:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:19,103 INFO L93 Difference]: Finished difference Result 449 states and 1162 transitions. [2020-10-22 02:11:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 02:11:19,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-22 02:11:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:19,109 INFO L225 Difference]: With dead ends: 449 [2020-10-22 02:11:19,109 INFO L226 Difference]: Without dead ends: 449 [2020-10-22 02:11:19,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2020-10-22 02:11:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-10-22 02:11:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 339. [2020-10-22 02:11:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-10-22 02:11:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 889 transitions. [2020-10-22 02:11:19,122 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 889 transitions. Word has length 14 [2020-10-22 02:11:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:19,122 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 889 transitions. [2020-10-22 02:11:19,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:11:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 889 transitions. [2020-10-22 02:11:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:11:19,124 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:19,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:19,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:11:19,124 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash -603535382, now seen corresponding path program 1 times [2020-10-22 02:11:19,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:19,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475134190] [2020-10-22 02:11:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:19,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475134190] [2020-10-22 02:11:19,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:19,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:11:19,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2088113942] [2020-10-22 02:11:19,235 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:19,238 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:19,244 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 24 transitions. [2020-10-22 02:11:19,244 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:19,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:19,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:11:19,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:11:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:11:19,298 INFO L87 Difference]: Start difference. First operand 339 states and 889 transitions. Second operand 4 states. [2020-10-22 02:11:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:19,339 INFO L93 Difference]: Finished difference Result 335 states and 779 transitions. [2020-10-22 02:11:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:11:19,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 02:11:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:19,342 INFO L225 Difference]: With dead ends: 335 [2020-10-22 02:11:19,342 INFO L226 Difference]: Without dead ends: 251 [2020-10-22 02:11:19,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:11:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-22 02:11:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2020-10-22 02:11:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-22 02:11:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 573 transitions. [2020-10-22 02:11:19,350 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 573 transitions. Word has length 14 [2020-10-22 02:11:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:19,351 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 573 transitions. [2020-10-22 02:11:19,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:11:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 573 transitions. [2020-10-22 02:11:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:11:19,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:19,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:19,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:11:19,352 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:19,353 INFO L82 PathProgramCache]: Analyzing trace with hash -111224858, now seen corresponding path program 1 times [2020-10-22 02:11:19,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:19,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939425608] [2020-10-22 02:11:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:19,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939425608] [2020-10-22 02:11:19,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:19,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:11:19,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579524993] [2020-10-22 02:11:19,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:19,724 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:19,728 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-22 02:11:19,728 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:19,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:19,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:11:19,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:19,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:11:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:19,730 INFO L87 Difference]: Start difference. First operand 251 states and 573 transitions. Second operand 8 states. [2020-10-22 02:11:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:20,130 INFO L93 Difference]: Finished difference Result 326 states and 747 transitions. [2020-10-22 02:11:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:11:20,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-22 02:11:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:20,135 INFO L225 Difference]: With dead ends: 326 [2020-10-22 02:11:20,135 INFO L226 Difference]: Without dead ends: 326 [2020-10-22 02:11:20,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:11:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-10-22 02:11:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 230. [2020-10-22 02:11:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-22 02:11:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 520 transitions. [2020-10-22 02:11:20,143 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 520 transitions. Word has length 15 [2020-10-22 02:11:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:20,144 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 520 transitions. [2020-10-22 02:11:20,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:11:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 520 transitions. [2020-10-22 02:11:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 02:11:20,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:20,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:20,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:11:20,145 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1352516661, now seen corresponding path program 1 times [2020-10-22 02:11:20,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:20,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586792810] [2020-10-22 02:11:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:20,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586792810] [2020-10-22 02:11:20,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:20,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:11:20,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1605757559] [2020-10-22 02:11:20,261 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:20,264 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:20,274 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 63 transitions. [2020-10-22 02:11:20,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:20,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14836#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:11:20,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:11:20,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:11:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:11:20,514 INFO L87 Difference]: Start difference. First operand 230 states and 520 transitions. Second operand 6 states. [2020-10-22 02:11:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:20,593 INFO L93 Difference]: Finished difference Result 197 states and 405 transitions. [2020-10-22 02:11:20,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:11:20,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-22 02:11:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:20,596 INFO L225 Difference]: With dead ends: 197 [2020-10-22 02:11:20,596 INFO L226 Difference]: Without dead ends: 155 [2020-10-22 02:11:20,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:11:20,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-22 02:11:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2020-10-22 02:11:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-22 02:11:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 311 transitions. [2020-10-22 02:11:20,601 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 311 transitions. Word has length 16 [2020-10-22 02:11:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:20,601 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 311 transitions. [2020-10-22 02:11:20,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:11:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 311 transitions. [2020-10-22 02:11:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:11:20,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:20,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:20,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:11:20,603 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:20,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1854808027, now seen corresponding path program 1 times [2020-10-22 02:11:20,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:20,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848134335] [2020-10-22 02:11:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:20,991 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-10-22 02:11:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:20,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848134335] [2020-10-22 02:11:20,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:20,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:11:20,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075151224] [2020-10-22 02:11:20,996 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:20,999 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:21,009 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 43 transitions. [2020-10-22 02:11:21,009 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:21,170 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 23 [2020-10-22 02:11:21,505 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:11:21,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:11:21,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:21,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:11:21,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:11:21,506 INFO L87 Difference]: Start difference. First operand 155 states and 311 transitions. Second operand 7 states. [2020-10-22 02:11:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:21,650 INFO L93 Difference]: Finished difference Result 165 states and 329 transitions. [2020-10-22 02:11:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:11:21,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-22 02:11:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:21,652 INFO L225 Difference]: With dead ends: 165 [2020-10-22 02:11:21,653 INFO L226 Difference]: Without dead ends: 165 [2020-10-22 02:11:21,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:11:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-22 02:11:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 145. [2020-10-22 02:11:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-22 02:11:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 290 transitions. [2020-10-22 02:11:21,658 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 290 transitions. Word has length 17 [2020-10-22 02:11:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:21,658 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 290 transitions. [2020-10-22 02:11:21,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:11:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 290 transitions. [2020-10-22 02:11:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:11:21,659 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:21,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:21,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:11:21,660 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1166763384, now seen corresponding path program 1 times [2020-10-22 02:11:21,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:21,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251812904] [2020-10-22 02:11:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:11:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:11:21,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251812904] [2020-10-22 02:11:21,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:11:21,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:11:21,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092162668] [2020-10-22 02:11:21,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:11:21,824 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:11:21,839 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 73 transitions. [2020-10-22 02:11:21,840 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:11:22,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15814#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:11:22,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:11:22,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:11:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:11:22,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:11:22,175 INFO L87 Difference]: Start difference. First operand 145 states and 290 transitions. Second operand 7 states. [2020-10-22 02:11:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:11:22,249 INFO L93 Difference]: Finished difference Result 131 states and 261 transitions. [2020-10-22 02:11:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:11:22,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 02:11:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:11:22,252 INFO L225 Difference]: With dead ends: 131 [2020-10-22 02:11:22,252 INFO L226 Difference]: Without dead ends: 73 [2020-10-22 02:11:22,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:11:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-22 02:11:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-22 02:11:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-22 02:11:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 140 transitions. [2020-10-22 02:11:22,256 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 140 transitions. Word has length 18 [2020-10-22 02:11:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:11:22,256 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 140 transitions. [2020-10-22 02:11:22,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:11:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 140 transitions. [2020-10-22 02:11:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:11:22,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:11:22,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:11:22,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 02:11:22,258 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:11:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:11:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1144169534, now seen corresponding path program 1 times [2020-10-22 02:11:22,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:11:22,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726432464] [2020-10-22 02:11:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:11:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:11:22,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:11:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:11:22,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:11:22,487 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:11:22,487 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:11:22,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 02:11:22,488 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:11:22,514 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1721] [1721] L859-->L866: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In1592167837 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In1592167837 256) 0)) (.cse10 (= (mod ~y$w_buff1_used~0_In1592167837 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In1592167837 256) 0))) (let ((.cse5 (or .cse10 .cse9)) (.cse3 (not .cse10)) (.cse4 (not .cse9)) (.cse6 (or .cse7 .cse8)) (.cse1 (not .cse8)) (.cse2 (not .cse7))) (and (= ~y$r_buff0_thd0~0_In1592167837 ~y$r_buff0_thd0~0_Out1592167837) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1592167837 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1592167837|) (let ((.cse0 (select |#memory_int_In1592167837| |~#y~0.base_In1592167837|))) (or (and (= (store |#memory_int_In1592167837| |~#y~0.base_In1592167837| (store .cse0 |~#y~0.offset_In1592167837| ~y$w_buff0~0_In1592167837)) |#memory_int_Out1592167837|) .cse1 .cse2) (and (or (and .cse3 .cse4 (= (store |#memory_int_In1592167837| |~#y~0.base_In1592167837| (store .cse0 |~#y~0.offset_In1592167837| ~y$w_buff1~0_In1592167837)) |#memory_int_Out1592167837|)) (and (= (store |#memory_int_In1592167837| |~#y~0.base_In1592167837| (store .cse0 |~#y~0.offset_In1592167837| (select .cse0 |~#y~0.offset_In1592167837|))) |#memory_int_Out1592167837|) .cse5)) .cse6))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1592167837 0)) (or (and (= ~y$w_buff1_used~0_Out1592167837 ~y$w_buff1_used~0_In1592167837) .cse5) (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out1592167837 0))) (or (and .cse6 (= ~y$w_buff0_used~0_In1592167837 ~y$w_buff0_used~0_Out1592167837)) (and (= 0 ~y$w_buff0_used~0_Out1592167837) .cse1 .cse2)) (= ~y$r_buff1_thd0~0_In1592167837 ~y$r_buff1_thd0~0_Out1592167837)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1592167837|, ~#y~0.offset=|~#y~0.offset_In1592167837|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592167837, ~y$w_buff1~0=~y$w_buff1~0_In1592167837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1592167837, ~y$w_buff0~0=~y$w_buff0~0_In1592167837, #memory_int=|#memory_int_In1592167837|, ~#y~0.base=|~#y~0.base_In1592167837|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1592167837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1592167837} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out1592167837|, ~#y~0.offset=|~#y~0.offset_In1592167837|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1592167837, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out1592167837|, ~#y~0.base=|~#y~0.base_In1592167837|, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out1592167837|, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out1592167837|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1592167837|, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out1592167837|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1592167837, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out1592167837|, ~y$w_buff1~0=~y$w_buff1~0_In1592167837, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out1592167837|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1592167837, ~y$w_buff0~0=~y$w_buff0~0_In1592167837, #memory_int=|#memory_int_Out1592167837|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1592167837, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1592167837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 02:11:22,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,538 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,538 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,543 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,550 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,550 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,551 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,551 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,551 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,552 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,552 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,553 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,553 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,553 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,553 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,554 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,554 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,554 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,555 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,555 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,555 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,556 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:11:22,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:11:22,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:11:22 BasicIcfg [2020-10-22 02:11:22,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:11:22,684 INFO L168 Benchmark]: Toolchain (without parser) took 36274.05 ms. Allocated memory was 140.0 MB in the beginning and 515.9 MB in the end (delta: 375.9 MB). Free memory was 102.1 MB in the beginning and 254.8 MB in the end (delta: -152.7 MB). Peak memory consumption was 223.2 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:22,685 INFO L168 Benchmark]: CDTParser took 2.52 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-22 02:11:22,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.57 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 153.3 MB in the end (delta: -52.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:22,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.35 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:22,687 INFO L168 Benchmark]: Boogie Preprocessor took 50.87 ms. Allocated memory is still 203.4 MB. Free memory was 149.9 MB in the beginning and 146.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:22,687 INFO L168 Benchmark]: RCFGBuilder took 3734.07 ms. Allocated memory was 203.4 MB in the beginning and 294.1 MB in the end (delta: 90.7 MB). Free memory was 146.6 MB in the beginning and 214.7 MB in the end (delta: -68.1 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:22,688 INFO L168 Benchmark]: TraceAbstraction took 31460.24 ms. Allocated memory was 294.1 MB in the beginning and 515.9 MB in the end (delta: 221.8 MB). Free memory was 214.7 MB in the beginning and 254.8 MB in the end (delta: -40.2 MB). Peak memory consumption was 181.6 MB. Max. memory is 7.1 GB. [2020-10-22 02:11:22,692 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.52 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 945.57 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 153.3 MB in the end (delta: -52.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.35 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.87 ms. Allocated memory is still 203.4 MB. Free memory was 149.9 MB in the beginning and 146.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3734.07 ms. Allocated memory was 203.4 MB in the beginning and 294.1 MB in the end (delta: 90.7 MB). Free memory was 146.6 MB in the beginning and 214.7 MB in the end (delta: -68.1 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31460.24 ms. Allocated memory was 294.1 MB in the beginning and 515.9 MB in the end (delta: 221.8 MB). Free memory was 214.7 MB in the beginning and 254.8 MB in the end (delta: -40.2 MB). Peak memory consumption was 181.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 827 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 60 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 20.5s, 124 PlacesBefore, 34 PlacesAfterwards, 117 TransitionsBefore, 24 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 4346 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1813; [L851] FCALL, FORK 0 pthread_create(&t1813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] EXPR 1 \read(y) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L764] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0 [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L852] 0 pthread_t t1814; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L853] FCALL, FORK 0 pthread_create(&t1814, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t1815; [L789] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=2, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=2, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L855] FCALL, FORK 0 pthread_create(&t1815, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x=2, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 y$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(y) [L812] 3 y$mem_tmp = y [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L815] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1 [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L815] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L816] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L816] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L817] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L819] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L819] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={5:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=2, y={5:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 y$flush_delayed = weak$$choice2 [L871] EXPR 0 \read(y) [L871] 0 y$mem_tmp = y [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L873] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L874] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L874] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L874] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L875] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L875] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L877] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 x == 2 && y == 2 [L881] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] 0 y = y$flush_delayed ? y$mem_tmp : y [L883] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe001_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=0, x=2, y={5:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.6s, HoareTripleCheckerStatistics: 263 SDtfs, 337 SDslu, 522 SDs, 0 SdLazy, 708 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 424 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 31385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...