/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 00:08:04,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 00:08:04,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 00:08:04,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 00:08:04,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 00:08:04,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 00:08:04,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 00:08:04,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 00:08:04,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 00:08:04,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 00:08:04,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 00:08:04,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 00:08:04,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 00:08:04,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 00:08:04,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 00:08:04,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 00:08:04,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 00:08:04,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 00:08:04,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 00:08:04,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 00:08:04,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 00:08:04,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 00:08:04,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 00:08:04,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 00:08:04,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 00:08:04,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 00:08:04,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 00:08:04,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 00:08:04,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 00:08:04,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 00:08:04,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 00:08:04,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 00:08:04,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 00:08:04,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 00:08:04,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 00:08:04,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 00:08:04,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 00:08:04,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 00:08:04,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 00:08:04,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 00:08:04,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 00:08:04,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative.epf [2021-08-13 00:08:04,508 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 00:08:04,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 00:08:04,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 00:08:04,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 00:08:04,512 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 00:08:04,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 00:08:04,512 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 00:08:04,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 00:08:04,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 00:08:04,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 00:08:04,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 00:08:04,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 00:08:04,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 00:08:04,513 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 00:08:04,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 00:08:04,513 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 00:08:04,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 00:08:04,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 00:08:04,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 00:08:04,514 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 00:08:04,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 00:08:04,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 00:08:04,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 00:08:04,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 00:08:04,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 00:08:04,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 00:08:04,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 00:08:04,515 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 00:08:04,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 00:08:04,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 00:08:04,515 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 00:08:04,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-13 00:08:04,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 00:08:04,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 00:08:04,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 00:08:04,838 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 00:08:04,839 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 00:08:04,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-08-13 00:08:04,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e1c0bbf/0b0f1c117720455db7856f2bd85350b6/FLAG00450b66d [2021-08-13 00:08:05,311 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 00:08:05,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-08-13 00:08:05,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e1c0bbf/0b0f1c117720455db7856f2bd85350b6/FLAG00450b66d [2021-08-13 00:08:05,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e1c0bbf/0b0f1c117720455db7856f2bd85350b6 [2021-08-13 00:08:05,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 00:08:05,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 00:08:05,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 00:08:05,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 00:08:05,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 00:08:05,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 12:08:05" (1/1) ... [2021-08-13 00:08:05,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af1d6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:05, skipping insertion in model container [2021-08-13 00:08:05,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 12:08:05" (1/1) ... [2021-08-13 00:08:05,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 00:08:05,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 00:08:05,773 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i[948,961] [2021-08-13 00:08:05,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 00:08:05,986 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 00:08:06,002 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i[948,961] [2021-08-13 00:08:06,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 00:08:06,065 INFO L208 MainTranslator]: Completed translation [2021-08-13 00:08:06,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06 WrapperNode [2021-08-13 00:08:06,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 00:08:06,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 00:08:06,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 00:08:06,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 00:08:06,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 00:08:06,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 00:08:06,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 00:08:06,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 00:08:06,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... [2021-08-13 00:08:06,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 00:08:06,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 00:08:06,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 00:08:06,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 00:08:06,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 00:08:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 00:08:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 00:08:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 00:08:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 00:08:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 00:08:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 00:08:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 00:08:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 00:08:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 00:08:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 00:08:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 00:08:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 00:08:06,171 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 00:08:07,554 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 00:08:07,555 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 00:08:07,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 12:08:07 BoogieIcfgContainer [2021-08-13 00:08:07,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 00:08:07,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 00:08:07,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 00:08:07,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 00:08:07,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 12:08:05" (1/3) ... [2021-08-13 00:08:07,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d12ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 12:08:07, skipping insertion in model container [2021-08-13 00:08:07,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:08:06" (2/3) ... [2021-08-13 00:08:07,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d12ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 12:08:07, skipping insertion in model container [2021-08-13 00:08:07,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 12:08:07" (3/3) ... [2021-08-13 00:08:07,560 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt.i [2021-08-13 00:08:07,565 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 00:08:07,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 00:08:07,565 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 00:08:07,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,587 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,594 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:08:07,594 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 00:08:07,608 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-13 00:08:07,626 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 00:08:07,626 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 00:08:07,626 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 00:08:07,626 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 00:08:07,626 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 00:08:07,626 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 00:08:07,626 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 00:08:07,626 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 00:08:07,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2021-08-13 00:08:07,655 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2021-08-13 00:08:07,655 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:08:07,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2021-08-13 00:08:07,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2021-08-13 00:08:07,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2021-08-13 00:08:07,668 INFO L129 PetriNetUnfolder]: 0/54 cut-off events. [2021-08-13 00:08:07,668 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:08:07,669 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:07,669 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:07,669 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 581779579, now seen corresponding path program 1 times [2021-08-13 00:08:07,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:07,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160482922] [2021-08-13 00:08:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:08:07,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:07,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:07,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:07,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:08:07,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:08:07,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160482922] [2021-08-13 00:08:07,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160482922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:08:07,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:08:07,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 00:08:07,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719855766] [2021-08-13 00:08:07,849 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 00:08:07,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:08:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 00:08:07,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 00:08:07,859 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 89 [2021-08-13 00:08:07,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:07,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:08:07,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 89 [2021-08-13 00:08:07,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:08:07,914 INFO L129 PetriNetUnfolder]: 16/191 cut-off events. [2021-08-13 00:08:07,914 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:08:07,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 191 events. 16/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 604 event pairs, 6 based on Foata normal form. 9/189 useless extension candidates. Maximal degree in co-relation 189. Up to 27 conditions per place. [2021-08-13 00:08:07,917 INFO L132 encePairwiseOnDemand]: 84/89 looper letters, 7 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2021-08-13 00:08:07,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 196 flow [2021-08-13 00:08:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 00:08:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 00:08:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2021-08-13 00:08:07,926 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2021-08-13 00:08:07,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2021-08-13 00:08:07,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2021-08-13 00:08:07,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:08:07,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2021-08-13 00:08:07,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:07,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:07,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:07,937 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 0 predicate places. [2021-08-13 00:08:07,937 INFO L482 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 196 flow [2021-08-13 00:08:07,937 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:07,937 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:07,937 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:07,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 00:08:07,938 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:07,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1072851851, now seen corresponding path program 1 times [2021-08-13 00:08:07,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:07,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679082033] [2021-08-13 00:08:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:08:08,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:08,047 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-08-13 00:08:08,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:08,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-08-13 00:08:08,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 00:08:08,090 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:08:08,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:08:08,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:08,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:08,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:08:08,122 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:08:08,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679082033] [2021-08-13 00:08:08,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679082033] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:08:08,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:08:08,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 00:08:08,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894406793] [2021-08-13 00:08:08,123 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 00:08:08,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:08:08,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 00:08:08,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-13 00:08:08,125 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 89 [2021-08-13 00:08:08,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 71.125) internal successors, (569), 8 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:08,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:08:08,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 89 [2021-08-13 00:08:08,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:08:08,623 INFO L129 PetriNetUnfolder]: 478/1609 cut-off events. [2021-08-13 00:08:08,623 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-08-13 00:08:08,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 1609 events. 478/1609 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12486 event pairs, 36 based on Foata normal form. 0/1544 useless extension candidates. Maximal degree in co-relation 2598. Up to 164 conditions per place. [2021-08-13 00:08:08,630 INFO L132 encePairwiseOnDemand]: 79/89 looper letters, 42 selfloop transitions, 12 changer transitions 90/213 dead transitions. [2021-08-13 00:08:08,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 213 transitions, 750 flow [2021-08-13 00:08:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-13 00:08:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-08-13 00:08:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1616 transitions. [2021-08-13 00:08:08,635 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.864633493846977 [2021-08-13 00:08:08,635 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1616 transitions. [2021-08-13 00:08:08,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1616 transitions. [2021-08-13 00:08:08,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:08:08,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1616 transitions. [2021-08-13 00:08:08,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 76.95238095238095) internal successors, (1616), 21 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:08,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 89.0) internal successors, (1958), 22 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:08,642 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 89.0) internal successors, (1958), 22 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:08,643 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 20 predicate places. [2021-08-13 00:08:08,643 INFO L482 AbstractCegarLoop]: Abstraction has has 112 places, 213 transitions, 750 flow [2021-08-13 00:08:08,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 71.125) internal successors, (569), 8 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:08,643 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:08,643 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:08,643 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 00:08:08,644 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1293599084, now seen corresponding path program 1 times [2021-08-13 00:08:08,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:08,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40135909] [2021-08-13 00:08:08,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:08:08,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:08,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:08,739 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:08:08,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:08:08,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:08,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:08,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:08,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:08:08,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:08:08,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40135909] [2021-08-13 00:08:08,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40135909] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:08:08,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:08:08,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:08:08,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391257831] [2021-08-13 00:08:08,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:08:08,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:08:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:08:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:08:08,777 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 89 [2021-08-13 00:08:08,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 213 transitions, 750 flow. Second operand has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:08,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:08:08,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 89 [2021-08-13 00:08:08,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:08:09,060 INFO L129 PetriNetUnfolder]: 585/2070 cut-off events. [2021-08-13 00:08:09,060 INFO L130 PetriNetUnfolder]: For 242/280 co-relation queries the response was YES. [2021-08-13 00:08:09,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 2070 events. 585/2070 cut-off events. For 242/280 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 18309 event pairs, 34 based on Foata normal form. 3/2034 useless extension candidates. Maximal degree in co-relation 3825. Up to 215 conditions per place. [2021-08-13 00:08:09,065 INFO L132 encePairwiseOnDemand]: 83/89 looper letters, 13 selfloop transitions, 4 changer transitions 178/283 dead transitions. [2021-08-13 00:08:09,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 283 transitions, 1310 flow [2021-08-13 00:08:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 00:08:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 00:08:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2021-08-13 00:08:09,069 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8938826466916354 [2021-08-13 00:08:09,069 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 716 transitions. [2021-08-13 00:08:09,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 716 transitions. [2021-08-13 00:08:09,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:08:09,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 716 transitions. [2021-08-13 00:08:09,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.55555555555556) internal successors, (716), 9 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,072 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,072 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 28 predicate places. [2021-08-13 00:08:09,072 INFO L482 AbstractCegarLoop]: Abstraction has has 120 places, 283 transitions, 1310 flow [2021-08-13 00:08:09,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,073 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:09,073 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:09,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 00:08:09,073 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1978965, now seen corresponding path program 1 times [2021-08-13 00:08:09,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:09,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273634937] [2021-08-13 00:08:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:08:09,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:09,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:09,189 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:08:09,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:08:09,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:09,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:09,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:08:09,220 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:08:09,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273634937] [2021-08-13 00:08:09,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273634937] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:08:09,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:08:09,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:08:09,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160250109] [2021-08-13 00:08:09,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:08:09,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:08:09,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:08:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:08:09,224 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 89 [2021-08-13 00:08:09,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 283 transitions, 1310 flow. Second operand has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:08:09,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 89 [2021-08-13 00:08:09,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:08:09,509 INFO L129 PetriNetUnfolder]: 657/2426 cut-off events. [2021-08-13 00:08:09,509 INFO L130 PetriNetUnfolder]: For 817/915 co-relation queries the response was YES. [2021-08-13 00:08:09,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 2426 events. 657/2426 cut-off events. For 817/915 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22834 event pairs, 36 based on Foata normal form. 11/2401 useless extension candidates. Maximal degree in co-relation 5069. Up to 275 conditions per place. [2021-08-13 00:08:09,532 INFO L132 encePairwiseOnDemand]: 83/89 looper letters, 13 selfloop transitions, 4 changer transitions 274/379 dead transitions. [2021-08-13 00:08:09,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 379 transitions, 2310 flow [2021-08-13 00:08:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 00:08:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 00:08:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2021-08-13 00:08:09,546 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8938826466916354 [2021-08-13 00:08:09,546 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 716 transitions. [2021-08-13 00:08:09,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 716 transitions. [2021-08-13 00:08:09,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:08:09,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 716 transitions. [2021-08-13 00:08:09,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.55555555555556) internal successors, (716), 9 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,549 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,549 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 36 predicate places. [2021-08-13 00:08:09,549 INFO L482 AbstractCegarLoop]: Abstraction has has 128 places, 379 transitions, 2310 flow [2021-08-13 00:08:09,549 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,549 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:09,549 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:09,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 00:08:09,550 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:09,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:09,550 INFO L82 PathProgramCache]: Analyzing trace with hash -528266137, now seen corresponding path program 1 times [2021-08-13 00:08:09,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:09,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059667704] [2021-08-13 00:08:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:08:09,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:09,742 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-08-13 00:08:09,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:09,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-08-13 00:08:09,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 00:08:09,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-08-13 00:08:09,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 00:08:09,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-08-13 00:08:09,826 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.8 percent of original size [2021-08-13 00:08:09,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-08-13 00:08:09,848 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:08:09,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:08:09,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:09,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:09,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:09,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:08:09,888 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:08:09,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059667704] [2021-08-13 00:08:09,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059667704] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:08:09,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:08:09,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 00:08:09,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683111991] [2021-08-13 00:08:09,890 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 00:08:09,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:08:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 00:08:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-13 00:08:09,892 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2021-08-13 00:08:09,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 379 transitions, 2310 flow. Second operand has 12 states, 12 states have (on average 65.25) internal successors, (783), 12 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:09,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:08:09,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2021-08-13 00:08:09,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:08:11,075 INFO L129 PetriNetUnfolder]: 2096/6106 cut-off events. [2021-08-13 00:08:11,075 INFO L130 PetriNetUnfolder]: For 3379/3473 co-relation queries the response was YES. [2021-08-13 00:08:11,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15795 conditions, 6106 events. 2096/6106 cut-off events. For 3379/3473 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 61631 event pairs, 64 based on Foata normal form. 22/6099 useless extension candidates. Maximal degree in co-relation 15733. Up to 848 conditions per place. [2021-08-13 00:08:11,095 INFO L132 encePairwiseOnDemand]: 74/89 looper letters, 35 selfloop transitions, 13 changer transitions 720/829 dead transitions. [2021-08-13 00:08:11,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 829 transitions, 6810 flow [2021-08-13 00:08:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-13 00:08:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-08-13 00:08:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1935 transitions. [2021-08-13 00:08:11,099 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7764847512038523 [2021-08-13 00:08:11,099 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1935 transitions. [2021-08-13 00:08:11,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1935 transitions. [2021-08-13 00:08:11,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:08:11,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1935 transitions. [2021-08-13 00:08:11,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 69.10714285714286) internal successors, (1935), 28 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 89.0) internal successors, (2581), 29 states have internal predecessors, (2581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,107 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 89.0) internal successors, (2581), 29 states have internal predecessors, (2581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,107 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 63 predicate places. [2021-08-13 00:08:11,107 INFO L482 AbstractCegarLoop]: Abstraction has has 155 places, 829 transitions, 6810 flow [2021-08-13 00:08:11,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 65.25) internal successors, (783), 12 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,108 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:11,108 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:11,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 00:08:11,108 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:11,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:11,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1647141148, now seen corresponding path program 1 times [2021-08-13 00:08:11,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:11,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782279990] [2021-08-13 00:08:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:08:11,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:11,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:11,152 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:08:11,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:08:11,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:08:11,168 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:08:11,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:11,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:08:11,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:08:11,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782279990] [2021-08-13 00:08:11,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782279990] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:08:11,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:08:11,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:08:11,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567776658] [2021-08-13 00:08:11,176 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:08:11,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:08:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:08:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:08:11,176 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2021-08-13 00:08:11,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 829 transitions, 6810 flow. Second operand has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:08:11,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2021-08-13 00:08:11,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:08:11,407 INFO L129 PetriNetUnfolder]: 414/1428 cut-off events. [2021-08-13 00:08:11,407 INFO L130 PetriNetUnfolder]: For 967/999 co-relation queries the response was YES. [2021-08-13 00:08:11,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3779 conditions, 1428 events. 414/1428 cut-off events. For 967/999 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10699 event pairs, 30 based on Foata normal form. 9/1379 useless extension candidates. Maximal degree in co-relation 3714. Up to 565 conditions per place. [2021-08-13 00:08:11,411 INFO L132 encePairwiseOnDemand]: 80/89 looper letters, 8 selfloop transitions, 8 changer transitions 158/251 dead transitions. [2021-08-13 00:08:11,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 251 transitions, 1662 flow [2021-08-13 00:08:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 00:08:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 00:08:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 795 transitions. [2021-08-13 00:08:11,413 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8932584269662921 [2021-08-13 00:08:11,413 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 795 transitions. [2021-08-13 00:08:11,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 795 transitions. [2021-08-13 00:08:11,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:08:11,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 795 transitions. [2021-08-13 00:08:11,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.5) internal successors, (795), 10 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,416 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,416 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 45 predicate places. [2021-08-13 00:08:11,416 INFO L482 AbstractCegarLoop]: Abstraction has has 137 places, 251 transitions, 1662 flow [2021-08-13 00:08:11,417 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,417 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:11,417 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:11,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 00:08:11,417 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash -625482944, now seen corresponding path program 1 times [2021-08-13 00:08:11,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:11,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184779048] [2021-08-13 00:08:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:08:11,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:11,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:11,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:08:11,458 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:08:11,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:08:11,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:08:11,476 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:08:11,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:08:11,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:08:11,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:08:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:08:11,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:08:11,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184779048] [2021-08-13 00:08:11,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184779048] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:08:11,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:08:11,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 00:08:11,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111528652] [2021-08-13 00:08:11,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 00:08:11,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:08:11,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 00:08:11,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 00:08:11,485 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2021-08-13 00:08:11,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 251 transitions, 1662 flow. Second operand has 7 states, 7 states have (on average 77.14285714285714) internal successors, (540), 7 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:08:11,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2021-08-13 00:08:11,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:08:11,641 INFO L129 PetriNetUnfolder]: 247/834 cut-off events. [2021-08-13 00:08:11,641 INFO L130 PetriNetUnfolder]: For 863/1081 co-relation queries the response was YES. [2021-08-13 00:08:11,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 834 events. 247/834 cut-off events. For 863/1081 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5723 event pairs, 5 based on Foata normal form. 70/876 useless extension candidates. Maximal degree in co-relation 2358. Up to 229 conditions per place. [2021-08-13 00:08:11,644 INFO L132 encePairwiseOnDemand]: 80/89 looper letters, 4 selfloop transitions, 8 changer transitions 92/181 dead transitions. [2021-08-13 00:08:11,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 181 transitions, 1134 flow [2021-08-13 00:08:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 00:08:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 00:08:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1024 transitions. [2021-08-13 00:08:11,646 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.88504753673293 [2021-08-13 00:08:11,646 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1024 transitions. [2021-08-13 00:08:11,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1024 transitions. [2021-08-13 00:08:11,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:08:11,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1024 transitions. [2021-08-13 00:08:11,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 78.76923076923077) internal successors, (1024), 13 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,650 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,650 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 42 predicate places. [2021-08-13 00:08:11,650 INFO L482 AbstractCegarLoop]: Abstraction has has 134 places, 181 transitions, 1134 flow [2021-08-13 00:08:11,650 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 77.14285714285714) internal successors, (540), 7 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:08:11,651 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:08:11,651 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:08:11,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 00:08:11,651 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:08:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:08:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1257075685, now seen corresponding path program 1 times [2021-08-13 00:08:11,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:08:11,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910665200] [2021-08-13 00:08:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:08:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 00:08:11,673 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 00:08:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 00:08:11,699 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 00:08:11,721 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 00:08:11,721 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 00:08:11,721 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 00:08:11,723 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 00:08:11,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 12:08:11 BasicIcfg [2021-08-13 00:08:11,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 00:08:11,798 INFO L168 Benchmark]: Toolchain (without parser) took 6155.29 ms. Allocated memory was 179.3 MB in the beginning and 397.4 MB in the end (delta: 218.1 MB). Free memory was 142.4 MB in the beginning and 130.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 230.3 MB. Max. memory is 8.0 GB. [2021-08-13 00:08:11,798 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 179.3 MB. Free memory is still 160.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 00:08:11,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.40 ms. Allocated memory is still 179.3 MB. Free memory was 142.2 MB in the beginning and 140.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 8.0 GB. [2021-08-13 00:08:11,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.72 ms. Allocated memory is still 179.3 MB. Free memory was 140.4 MB in the beginning and 137.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 00:08:11,799 INFO L168 Benchmark]: Boogie Preprocessor took 19.94 ms. Allocated memory is still 179.3 MB. Free memory was 137.8 MB in the beginning and 135.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 00:08:11,799 INFO L168 Benchmark]: RCFGBuilder took 1433.40 ms. Allocated memory is still 179.3 MB. Free memory was 135.7 MB in the beginning and 124.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. [2021-08-13 00:08:11,799 INFO L168 Benchmark]: TraceAbstraction took 4239.89 ms. Allocated memory was 179.3 MB in the beginning and 397.4 MB in the end (delta: 218.1 MB). Free memory was 124.4 MB in the beginning and 130.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 212.1 MB. Max. memory is 8.0 GB. [2021-08-13 00:08:11,801 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 179.3 MB. Free memory is still 160.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 422.40 ms. Allocated memory is still 179.3 MB. Free memory was 142.2 MB in the beginning and 140.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 35.72 ms. Allocated memory is still 179.3 MB. Free memory was 140.4 MB in the beginning and 137.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 19.94 ms. Allocated memory is still 179.3 MB. Free memory was 137.8 MB in the beginning and 135.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1433.40 ms. Allocated memory is still 179.3 MB. Free memory was 135.7 MB in the beginning and 124.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4239.89 ms. Allocated memory was 179.3 MB in the beginning and 397.4 MB in the end (delta: 218.1 MB). Free memory was 124.4 MB in the beginning and 130.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 212.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 0 pthread_t t1595; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] FCALL, FORK 0 pthread_create(&t1595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1596; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L803] FCALL, FORK 0 pthread_create(&t1596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4103.2ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2847.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 34.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 63 SDtfs, 382 SDslu, 253 SDs, 0 SdLazy, 574 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 384.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1123.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6810occurred in iteration=5, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 29.3ms SsaConstructionTime, 242.0ms SatisfiabilityAnalysisTime, 766.3ms InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 419 ConstructedInterpolants, 0 QuantifiedInterpolants, 1821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...