/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-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 10:18:12,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 10:18:12,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 10:18:12,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 10:18:12,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 10:18:12,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 10:18:12,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 10:18:12,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 10:18:12,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 10:18:12,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 10:18:12,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 10:18:12,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 10:18:12,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 10:18:12,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 10:18:12,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 10:18:12,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 10:18:12,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 10:18:12,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 10:18:12,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 10:18:12,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 10:18:12,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 10:18:12,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 10:18:12,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 10:18:12,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 10:18:12,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 10:18:12,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 10:18:12,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 10:18:12,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 10:18:12,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 10:18:12,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 10:18:12,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 10:18:12,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 10:18:12,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 10:18:12,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 10:18:12,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 10:18:12,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 10:18:12,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 10:18:12,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 10:18:12,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 10:18:12,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 10:18:12,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 10:18:12,468 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-Hitting.epf [2021-08-13 10:18:12,489 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 10:18:12,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 10:18:12,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 10:18:12,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 10:18:12,491 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 10:18:12,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 10:18:12,491 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 10:18:12,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 10:18:12,492 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 10:18:12,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 10:18:12,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 10:18:12,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 10:18:12,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 10:18:12,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 10:18:12,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 10:18:12,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 10:18:12,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 10:18:12,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 10:18:12,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 10:18:12,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 10:18:12,504 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 10:18:12,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 10:18:12,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 10:18:12,505 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 10:18:12,505 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 10:18:12,505 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 10:18:12,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 10:18:12,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 10:18:12,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 10:18:12,803 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 10:18:12,804 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 10:18:12,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i [2021-08-13 10:18:12,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69669386c/3ca451e900ee43f4a5fd09a41ae99646/FLAG090e8d7f2 [2021-08-13 10:18:13,269 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 10:18:13,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i [2021-08-13 10:18:13,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69669386c/3ca451e900ee43f4a5fd09a41ae99646/FLAG090e8d7f2 [2021-08-13 10:18:13,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69669386c/3ca451e900ee43f4a5fd09a41ae99646 [2021-08-13 10:18:13,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 10:18:13,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 10:18:13,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 10:18:13,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 10:18:13,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 10:18:13,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46555fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13, skipping insertion in model container [2021-08-13 10:18:13,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 10:18:13,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 10:18:13,482 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/mix057_power.oepc.i[951,964] [2021-08-13 10:18:13,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 10:18:13,700 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 10:18:13,708 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/mix057_power.oepc.i[951,964] [2021-08-13 10:18:13,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 10:18:13,809 INFO L208 MainTranslator]: Completed translation [2021-08-13 10:18:13,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13 WrapperNode [2021-08-13 10:18:13,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 10:18:13,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 10:18:13,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 10:18:13,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 10:18:13,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 10:18:13,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 10:18:13,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 10:18:13,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 10:18:13,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (1/1) ... [2021-08-13 10:18:13,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 10:18:13,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 10:18:13,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 10:18:13,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 10:18:13,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (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 10:18:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 10:18:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 10:18:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 10:18:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 10:18:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 10:18:13,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 10:18:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 10:18:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 10:18:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 10:18:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 10:18:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-13 10:18:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-13 10:18:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 10:18:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 10:18:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 10:18:13,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 10:18:13,975 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 10:18:15,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 10:18:15,660 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 10:18:15,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:18:15 BoogieIcfgContainer [2021-08-13 10:18:15,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 10:18:15,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 10:18:15,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 10:18:15,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 10:18:15,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 10:18:13" (1/3) ... [2021-08-13 10:18:15,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f1119e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:18:15, skipping insertion in model container [2021-08-13 10:18:15,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:18:13" (2/3) ... [2021-08-13 10:18:15,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f1119e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:18:15, skipping insertion in model container [2021-08-13 10:18:15,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:18:15" (3/3) ... [2021-08-13 10:18:15,669 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc.i [2021-08-13 10:18:15,676 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 10:18:15,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 10:18:15,677 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,720 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,720 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,721 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,721 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,724 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,739 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,748 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,759 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:18:15,760 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 10:18:15,775 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-13 10:18:15,793 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 10:18:15,794 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 10:18:15,794 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 10:18:15,794 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 10:18:15,794 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 10:18:15,794 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 10:18:15,794 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 10:18:15,794 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 10:18:15,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2021-08-13 10:18:15,839 INFO L129 PetriNetUnfolder]: 2/122 cut-off events. [2021-08-13 10:18:15,839 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:18:15,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-08-13 10:18:15,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2021-08-13 10:18:15,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2021-08-13 10:18:15,850 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-08-13 10:18:15,850 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:18:15,851 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:18:15,851 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] [2021-08-13 10:18:15,851 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:18:15,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:18:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1580227812, now seen corresponding path program 1 times [2021-08-13 10:18:15,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:18:15,860 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860918204] [2021-08-13 10:18:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:18:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:18:16,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:16,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:16,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:16,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:18:16,068 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 10:18:16,069 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:18:16,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860918204] [2021-08-13 10:18:16,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860918204] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:18:16,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:18:16,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 10:18:16,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131265521] [2021-08-13 10:18:16,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 10:18:16,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:18:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 10:18:16,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 10:18:16,085 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 126 [2021-08-13 10:18:16,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 10:18:16,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:18:16,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 126 [2021-08-13 10:18:16,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:18:16,265 INFO L129 PetriNetUnfolder]: 133/483 cut-off events. [2021-08-13 10:18:16,265 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:18:16,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 483 events. 133/483 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2537 event pairs, 110 based on Foata normal form. 45/495 useless extension candidates. Maximal degree in co-relation 651. Up to 153 conditions per place. [2021-08-13 10:18:16,273 INFO L132 encePairwiseOnDemand]: 121/126 looper letters, 11 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2021-08-13 10:18:16,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 284 flow [2021-08-13 10:18:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 10:18:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 10:18:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2021-08-13 10:18:16,286 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2021-08-13 10:18:16,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2021-08-13 10:18:16,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2021-08-13 10:18:16,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:18:16,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2021-08-13 10:18:16,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 10:18:16,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 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 10:18:16,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 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 10:18:16,301 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2021-08-13 10:18:16,301 INFO L482 AbstractCegarLoop]: Abstraction has has 133 places, 123 transitions, 284 flow [2021-08-13 10:18:16,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 10:18:16,301 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:18:16,303 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:18:16,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 10:18:16,304 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:18:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:18:16,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1353395829, now seen corresponding path program 1 times [2021-08-13 10:18:16,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:18:16,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519516644] [2021-08-13 10:18:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:18:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:18:16,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:16,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:16,447 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-08-13 10:18:16,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 10:18:16,457 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:18:16,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:18:16,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:16,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:16,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:16,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:16,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:16,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:16,512 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 10:18:16,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:18:16,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519516644] [2021-08-13 10:18:16,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519516644] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:18:16,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:18:16,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:18:16,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186753558] [2021-08-13 10:18:16,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:18:16,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:18:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:18:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:18:16,518 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 126 [2021-08-13 10:18:16,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 123 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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 10:18:16,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:18:16,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 126 [2021-08-13 10:18:16,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:18:19,044 INFO L129 PetriNetUnfolder]: 6836/18624 cut-off events. [2021-08-13 10:18:19,045 INFO L130 PetriNetUnfolder]: For 1296/2116 co-relation queries the response was YES. [2021-08-13 10:18:19,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30979 conditions, 18624 events. 6836/18624 cut-off events. For 1296/2116 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 221866 event pairs, 2541 based on Foata normal form. 31/17236 useless extension candidates. Maximal degree in co-relation 30922. Up to 4172 conditions per place. [2021-08-13 10:18:19,210 INFO L132 encePairwiseOnDemand]: 114/126 looper letters, 51 selfloop transitions, 38 changer transitions 0/193 dead transitions. [2021-08-13 10:18:19,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 193 transitions, 630 flow [2021-08-13 10:18:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 10:18:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 10:18:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1028 transitions. [2021-08-13 10:18:19,213 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9065255731922398 [2021-08-13 10:18:19,213 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1028 transitions. [2021-08-13 10:18:19,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1028 transitions. [2021-08-13 10:18:19,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:18:19,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1028 transitions. [2021-08-13 10:18:19,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 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 10:18:19,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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 10:18:19,218 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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 10:18:19,218 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 8 predicate places. [2021-08-13 10:18:19,218 INFO L482 AbstractCegarLoop]: Abstraction has has 141 places, 193 transitions, 630 flow [2021-08-13 10:18:19,219 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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 10:18:19,219 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:18:19,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:18:19,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 10:18:19,219 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:18:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:18:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1305749516, now seen corresponding path program 1 times [2021-08-13 10:18:19,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:18:19,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591518009] [2021-08-13 10:18:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:18:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:18:19,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:19,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:19,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:19,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:18:19,326 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-08-13 10:18:19,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 10:18:19,335 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:18:19,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:18:19,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:19,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:19,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:19,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:19,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:19,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:19,370 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 10:18:19,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:18:19,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591518009] [2021-08-13 10:18:19,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591518009] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:18:19,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:18:19,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:18:19,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204078360] [2021-08-13 10:18:19,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:18:19,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:18:19,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:18:19,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:18:19,373 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 126 [2021-08-13 10:18:19,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 193 transitions, 630 flow. Second operand has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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 10:18:19,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:18:19,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 126 [2021-08-13 10:18:19,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:18:22,060 INFO L129 PetriNetUnfolder]: 7801/22251 cut-off events. [2021-08-13 10:18:22,060 INFO L130 PetriNetUnfolder]: For 2887/12724 co-relation queries the response was YES. [2021-08-13 10:18:22,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45265 conditions, 22251 events. 7801/22251 cut-off events. For 2887/12724 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 279534 event pairs, 2104 based on Foata normal form. 214/20626 useless extension candidates. Maximal degree in co-relation 45202. Up to 4855 conditions per place. [2021-08-13 10:18:22,229 INFO L132 encePairwiseOnDemand]: 113/126 looper letters, 136 selfloop transitions, 99 changer transitions 12/351 dead transitions. [2021-08-13 10:18:22,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 351 transitions, 1780 flow [2021-08-13 10:18:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:18:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:18:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1478 transitions. [2021-08-13 10:18:22,232 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2021-08-13 10:18:22,232 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1478 transitions. [2021-08-13 10:18:22,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1478 transitions. [2021-08-13 10:18:22,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:18:22,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1478 transitions. [2021-08-13 10:18:22,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.6923076923077) internal successors, (1478), 13 states have internal predecessors, (1478), 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 10:18:22,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:22,239 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:22,239 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 20 predicate places. [2021-08-13 10:18:22,239 INFO L482 AbstractCegarLoop]: Abstraction has has 153 places, 351 transitions, 1780 flow [2021-08-13 10:18:22,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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 10:18:22,240 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:18:22,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:18:22,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 10:18:22,240 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:18:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:18:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1235721524, now seen corresponding path program 1 times [2021-08-13 10:18:22,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:18:22,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64394315] [2021-08-13 10:18:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:18:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:18:22,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:22,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:22,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:22,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:18:22,320 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-08-13 10:18:22,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 10:18:22,329 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:18:22,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:18:22,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:22,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:22,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:22,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:22,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:22,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:22,357 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 10:18:22,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:18:22,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64394315] [2021-08-13 10:18:22,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64394315] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:18:22,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:18:22,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:18:22,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508465044] [2021-08-13 10:18:22,358 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:18:22,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:18:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:18:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:18:22,359 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 126 [2021-08-13 10:18:22,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 351 transitions, 1780 flow. Second operand has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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 10:18:22,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:18:22,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 126 [2021-08-13 10:18:22,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:18:25,849 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1098] L800-->L807: Formula: (let ((.cse11 (= (mod v_~a$w_buff0_used~0_471 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_380 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse13 (= (mod v_~a$w_buff0_used~0_472 256) 0))) (let ((.cse0 (or .cse12 .cse13)) (.cse6 (or .cse10 .cse14)) (.cse4 (not .cse14)) (.cse5 (not .cse10)) (.cse2 (not .cse13)) (.cse7 (or .cse12 .cse11)) (.cse1 (not .cse12)) (.cse3 (not .cse11))) (and (or (and .cse0 (= v_~a$w_buff0_used~0_472 v_~a$w_buff0_used~0_471)) (and .cse1 (= v_~a$w_buff0_used~0_471 0) .cse2)) (or (and (= v_~a$w_buff1_used~0_379 0) (or (and .cse1 .cse3) (and .cse4 .cse5))) (and .cse6 .cse7 (= v_~a$w_buff1_used~0_379 v_~a$w_buff1_used~0_380))) (let ((.cse9 (= (mod v_~a$w_buff1_used~0_379 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd3~0_67 256) 0))) (or (and (or (and (not .cse8) .cse3) (and .cse5 (not .cse9))) (= v_~a$r_buff1_thd3~0_51 0)) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse10 .cse9) (or .cse11 .cse8)))) (or (and .cse0 (= |v_P2_#t~ite17_47| v_~a~0_182) (or (and .cse6 (= |v_P2_#t~ite17_47| v_~a~0_183)) (and .cse4 (= |v_P2_#t~ite17_47| v_~a$w_buff1~0_126) .cse5))) (and (= v_~a~0_182 v_~a$w_buff0~0_115) .cse1 (= |v_P2_#t~ite17_47| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2)) (or (and .cse7 (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67)) (and .cse1 .cse3 (= v_~a$r_buff0_thd3~0_67 0)))))) InVars {~a~0=v_~a~0_183, ~a$w_buff1~0=v_~a$w_buff1~0_126, ~a$w_buff0~0=v_~a$w_buff0~0_115, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_472, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_380, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_471, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_182, ~a$w_buff1~0=v_~a$w_buff1~0_126, ~a$w_buff0~0=v_~a$w_buff0~0_115, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_379, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_47|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][87], [131#L767true, 37#L787true, 134#true, 136#true, 9#L18-1true, 138#true, 140#true, 141#true, 147#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 86#L840true, 184#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 27#L807true, 189#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2021-08-13 10:18:25,850 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-08-13 10:18:25,850 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-13 10:18:25,850 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-13 10:18:25,850 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-13 10:18:25,951 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1098] L800-->L807: Formula: (let ((.cse11 (= (mod v_~a$w_buff0_used~0_471 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_380 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse13 (= (mod v_~a$w_buff0_used~0_472 256) 0))) (let ((.cse0 (or .cse12 .cse13)) (.cse6 (or .cse10 .cse14)) (.cse4 (not .cse14)) (.cse5 (not .cse10)) (.cse2 (not .cse13)) (.cse7 (or .cse12 .cse11)) (.cse1 (not .cse12)) (.cse3 (not .cse11))) (and (or (and .cse0 (= v_~a$w_buff0_used~0_472 v_~a$w_buff0_used~0_471)) (and .cse1 (= v_~a$w_buff0_used~0_471 0) .cse2)) (or (and (= v_~a$w_buff1_used~0_379 0) (or (and .cse1 .cse3) (and .cse4 .cse5))) (and .cse6 .cse7 (= v_~a$w_buff1_used~0_379 v_~a$w_buff1_used~0_380))) (let ((.cse9 (= (mod v_~a$w_buff1_used~0_379 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd3~0_67 256) 0))) (or (and (or (and (not .cse8) .cse3) (and .cse5 (not .cse9))) (= v_~a$r_buff1_thd3~0_51 0)) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse10 .cse9) (or .cse11 .cse8)))) (or (and .cse0 (= |v_P2_#t~ite17_47| v_~a~0_182) (or (and .cse6 (= |v_P2_#t~ite17_47| v_~a~0_183)) (and .cse4 (= |v_P2_#t~ite17_47| v_~a$w_buff1~0_126) .cse5))) (and (= v_~a~0_182 v_~a$w_buff0~0_115) .cse1 (= |v_P2_#t~ite17_47| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse2)) (or (and .cse7 (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67)) (and .cse1 .cse3 (= v_~a$r_buff0_thd3~0_67 0)))))) InVars {~a~0=v_~a~0_183, ~a$w_buff1~0=v_~a$w_buff1~0_126, ~a$w_buff0~0=v_~a$w_buff0~0_115, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_472, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_380, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_471, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_182, ~a$w_buff1~0=v_~a$w_buff1~0_126, ~a$w_buff0~0=v_~a$w_buff0~0_115, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_379, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_47|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][87], [131#L767true, 37#L787true, 134#true, 136#true, 138#true, 140#true, 141#true, 17#L18-5true, 147#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 86#L840true, 184#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 27#L807true, 189#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2021-08-13 10:18:25,951 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-08-13 10:18:25,951 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-08-13 10:18:25,951 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-08-13 10:18:25,951 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-08-13 10:18:26,310 INFO L129 PetriNetUnfolder]: 10834/31196 cut-off events. [2021-08-13 10:18:26,310 INFO L130 PetriNetUnfolder]: For 6243/20872 co-relation queries the response was YES. [2021-08-13 10:18:26,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75214 conditions, 31196 events. 10834/31196 cut-off events. For 6243/20872 co-relation queries the response was YES. Maximal size of possible extension queue 2268. Compared 415012 event pairs, 2478 based on Foata normal form. 300/28980 useless extension candidates. Maximal degree in co-relation 75145. Up to 7002 conditions per place. [2021-08-13 10:18:26,573 INFO L132 encePairwiseOnDemand]: 114/126 looper letters, 272 selfloop transitions, 226 changer transitions 69/671 dead transitions. [2021-08-13 10:18:26,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 671 transitions, 4962 flow [2021-08-13 10:18:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:18:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:18:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1478 transitions. [2021-08-13 10:18:26,576 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2021-08-13 10:18:26,576 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1478 transitions. [2021-08-13 10:18:26,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1478 transitions. [2021-08-13 10:18:26,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:18:26,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1478 transitions. [2021-08-13 10:18:26,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.6923076923077) internal successors, (1478), 13 states have internal predecessors, (1478), 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 10:18:26,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:26,581 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:26,581 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 32 predicate places. [2021-08-13 10:18:26,581 INFO L482 AbstractCegarLoop]: Abstraction has has 165 places, 671 transitions, 4962 flow [2021-08-13 10:18:26,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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 10:18:26,581 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:18:26,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:18:26,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 10:18:26,582 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:18:26,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:18:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1578110315, now seen corresponding path program 1 times [2021-08-13 10:18:26,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:18:26,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859942356] [2021-08-13 10:18:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:18:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:18:26,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:26,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:26,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:26,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:18:26,650 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-08-13 10:18:26,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 10:18:26,661 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:18:26,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:18:26,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:26,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:26,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:26,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:26,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:26,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:26,687 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 10:18:26,687 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:18:26,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859942356] [2021-08-13 10:18:26,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859942356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:18:26,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:18:26,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:18:26,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136109234] [2021-08-13 10:18:26,688 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:18:26,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:18:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:18:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:18:26,689 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 126 [2021-08-13 10:18:26,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 671 transitions, 4962 flow. Second operand has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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 10:18:26,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:18:26,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 126 [2021-08-13 10:18:26,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:18:33,132 INFO L129 PetriNetUnfolder]: 14781/44477 cut-off events. [2021-08-13 10:18:33,132 INFO L130 PetriNetUnfolder]: For 12645/38376 co-relation queries the response was YES. [2021-08-13 10:18:33,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118837 conditions, 44477 events. 14781/44477 cut-off events. For 12645/38376 co-relation queries the response was YES. Maximal size of possible extension queue 3307. Compared 638113 event pairs, 3730 based on Foata normal form. 497/41871 useless extension candidates. Maximal degree in co-relation 118762. Up to 10171 conditions per place. [2021-08-13 10:18:33,551 INFO L132 encePairwiseOnDemand]: 113/126 looper letters, 457 selfloop transitions, 405 changer transitions 163/1129 dead transitions. [2021-08-13 10:18:33,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1129 transitions, 10878 flow [2021-08-13 10:18:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:18:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:18:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1478 transitions. [2021-08-13 10:18:33,555 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2021-08-13 10:18:33,555 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1478 transitions. [2021-08-13 10:18:33,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1478 transitions. [2021-08-13 10:18:33,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:18:33,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1478 transitions. [2021-08-13 10:18:33,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.6923076923077) internal successors, (1478), 13 states have internal predecessors, (1478), 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 10:18:33,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:33,561 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:33,561 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 44 predicate places. [2021-08-13 10:18:33,561 INFO L482 AbstractCegarLoop]: Abstraction has has 177 places, 1129 transitions, 10878 flow [2021-08-13 10:18:33,561 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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 10:18:33,561 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:18:33,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:18:33,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 10:18:33,562 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:18:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:18:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 931234561, now seen corresponding path program 1 times [2021-08-13 10:18:33,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:18:33,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607221225] [2021-08-13 10:18:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:18:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:18:33,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:33,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:33,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:33,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:18:33,605 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-08-13 10:18:33,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 10:18:33,633 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:18:33,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:18:33,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:33,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:33,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:33,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:33,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:33,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:33,679 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 10:18:33,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:18:33,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607221225] [2021-08-13 10:18:33,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607221225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:18:33,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:18:33,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:18:33,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675574927] [2021-08-13 10:18:33,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:18:33,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:18:33,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:18:33,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:18:33,686 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 126 [2021-08-13 10:18:33,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 1129 transitions, 10878 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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 10:18:33,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:18:33,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 126 [2021-08-13 10:18:33,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:18:43,726 INFO L129 PetriNetUnfolder]: 19804/61133 cut-off events. [2021-08-13 10:18:43,727 INFO L130 PetriNetUnfolder]: For 25858/82738 co-relation queries the response was YES. [2021-08-13 10:18:44,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176922 conditions, 61133 events. 19804/61133 cut-off events. For 25858/82738 co-relation queries the response was YES. Maximal size of possible extension queue 4810. Compared 928189 event pairs, 5988 based on Foata normal form. 893/57499 useless extension candidates. Maximal degree in co-relation 176841. Up to 15255 conditions per place. [2021-08-13 10:18:44,226 INFO L132 encePairwiseOnDemand]: 114/126 looper letters, 642 selfloop transitions, 436 changer transitions 299/1481 dead transitions. [2021-08-13 10:18:44,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1481 transitions, 17340 flow [2021-08-13 10:18:44,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:18:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:18:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1479 transitions. [2021-08-13 10:18:44,228 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2021-08-13 10:18:44,229 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1479 transitions. [2021-08-13 10:18:44,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1479 transitions. [2021-08-13 10:18:44,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:18:44,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1479 transitions. [2021-08-13 10:18:44,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.76923076923077) internal successors, (1479), 13 states have internal predecessors, (1479), 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 10:18:44,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:44,234 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:18:44,234 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 56 predicate places. [2021-08-13 10:18:44,234 INFO L482 AbstractCegarLoop]: Abstraction has has 189 places, 1481 transitions, 17340 flow [2021-08-13 10:18:44,235 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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 10:18:44,235 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:18:44,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:18:44,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 10:18:44,235 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:18:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:18:44,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1531097702, now seen corresponding path program 1 times [2021-08-13 10:18:44,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:18:44,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269051301] [2021-08-13 10:18:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:18:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:18:44,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:44,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:44,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:44,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:18:44,269 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:18:44,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:18:44,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:44,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:44,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:44,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:18:44,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:18:44,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:18:44,291 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 10:18:44,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:18:44,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269051301] [2021-08-13 10:18:44,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269051301] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:18:44,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:18:44,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:18:44,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366919070] [2021-08-13 10:18:44,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:18:44,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:18:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:18:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:18:44,293 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 126 [2021-08-13 10:18:44,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1481 transitions, 17340 flow. Second operand has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 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 10:18:44,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:18:44,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 126 [2021-08-13 10:18:44,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:18:57,871 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L780-->L787: Formula: (let ((.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse11 (= 0 (mod v_~a$w_buff0_used~0_455 256))) (.cse13 (= (mod v_~a$r_buff0_thd2~0_70 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd2~0_52 256) 0)) (.cse14 (= 0 (mod v_~a$w_buff1_used~0_364 256)))) (let ((.cse1 (or .cse10 .cse14)) (.cse2 (not .cse14)) (.cse6 (or .cse11 .cse13)) (.cse0 (or .cse12 .cse13)) (.cse4 (not .cse13)) (.cse5 (not .cse12)) (.cse7 (not .cse11)) (.cse3 (not .cse10))) (and (or (and .cse0 (= v_~a~0_166 |v_P1_#t~ite11_49|) (or (and (= v_~a~0_167 |v_P1_#t~ite11_49|) .cse1) (and .cse2 .cse3 (= |v_P1_#t~ite11_49| v_~a$w_buff1~0_116)))) (and (= v_~a~0_166 v_~a$w_buff0~0_109) .cse4 (= |v_P1_#t~ite11_49| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse5)) (or (and (= v_~a$w_buff1_used~0_364 v_~a$w_buff1_used~0_363) .cse1 .cse6) (and (or (and .cse4 .cse7) (and .cse2 .cse3)) (= v_~a$w_buff1_used~0_363 0))) (or (and .cse4 .cse7 (= v_~a$r_buff0_thd2~0_69 0)) (and (= v_~a$r_buff0_thd2~0_69 v_~a$r_buff0_thd2~0_70) .cse6)) (or (and .cse0 (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455)) (and .cse4 .cse5 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse9 (= 0 (mod v_~a$w_buff1_used~0_363 256))) (.cse8 (= (mod v_~a$r_buff0_thd2~0_69 256) 0))) (or (and (or (and .cse7 (not .cse8)) (and (not .cse9) .cse3)) (= v_~a$r_buff1_thd2~0_51 0)) (and (or .cse10 .cse9) (or .cse11 .cse8) (= v_~a$r_buff1_thd2~0_52 v_~a$r_buff1_thd2~0_51))))))) InVars {~a~0=v_~a~0_167, ~a$w_buff1~0=v_~a$w_buff1~0_116, ~a$w_buff0~0=v_~a$w_buff0~0_109, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_52, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_70, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_364} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_69, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~a~0=v_~a~0_166, ~a$w_buff1~0=v_~a$w_buff1~0_116, ~a$w_buff0~0=v_~a$w_buff0~0_109, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_363} AuxVars[|v_P1_#t~ite11_49|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, ~a$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][66], [131#L767true, 37#L787true, 165#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 134#true, 136#true, 10#L18true, 138#true, 140#true, 236#(= ~y~0 1), 141#true, 271#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|))), 147#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 213#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 86#L840true, 27#L807true, 189#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2021-08-13 10:18:57,871 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-08-13 10:18:57,871 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-08-13 10:18:57,871 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-08-13 10:18:57,871 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-08-13 10:18:59,351 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L780-->L787: Formula: (let ((.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse11 (= 0 (mod v_~a$w_buff0_used~0_455 256))) (.cse13 (= (mod v_~a$r_buff0_thd2~0_70 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd2~0_52 256) 0)) (.cse14 (= 0 (mod v_~a$w_buff1_used~0_364 256)))) (let ((.cse1 (or .cse10 .cse14)) (.cse2 (not .cse14)) (.cse6 (or .cse11 .cse13)) (.cse0 (or .cse12 .cse13)) (.cse4 (not .cse13)) (.cse5 (not .cse12)) (.cse7 (not .cse11)) (.cse3 (not .cse10))) (and (or (and .cse0 (= v_~a~0_166 |v_P1_#t~ite11_49|) (or (and (= v_~a~0_167 |v_P1_#t~ite11_49|) .cse1) (and .cse2 .cse3 (= |v_P1_#t~ite11_49| v_~a$w_buff1~0_116)))) (and (= v_~a~0_166 v_~a$w_buff0~0_109) .cse4 (= |v_P1_#t~ite11_49| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse5)) (or (and (= v_~a$w_buff1_used~0_364 v_~a$w_buff1_used~0_363) .cse1 .cse6) (and (or (and .cse4 .cse7) (and .cse2 .cse3)) (= v_~a$w_buff1_used~0_363 0))) (or (and .cse4 .cse7 (= v_~a$r_buff0_thd2~0_69 0)) (and (= v_~a$r_buff0_thd2~0_69 v_~a$r_buff0_thd2~0_70) .cse6)) (or (and .cse0 (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455)) (and .cse4 .cse5 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse9 (= 0 (mod v_~a$w_buff1_used~0_363 256))) (.cse8 (= (mod v_~a$r_buff0_thd2~0_69 256) 0))) (or (and (or (and .cse7 (not .cse8)) (and (not .cse9) .cse3)) (= v_~a$r_buff1_thd2~0_51 0)) (and (or .cse10 .cse9) (or .cse11 .cse8) (= v_~a$r_buff1_thd2~0_52 v_~a$r_buff1_thd2~0_51))))))) InVars {~a~0=v_~a~0_167, ~a$w_buff1~0=v_~a$w_buff1~0_116, ~a$w_buff0~0=v_~a$w_buff0~0_109, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_52, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_70, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_364} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_69, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~a~0=v_~a~0_166, ~a$w_buff1~0=v_~a$w_buff1~0_116, ~a$w_buff0~0=v_~a$w_buff0~0_109, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_363} AuxVars[|v_P1_#t~ite11_49|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, ~a$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][66], [131#L767true, 37#L787true, 165#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 134#true, 136#true, 9#L18-1true, 138#true, 140#true, 236#(= ~y~0 1), 141#true, 147#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 275#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 213#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 86#L840true, 27#L807true, 189#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2021-08-13 10:18:59,352 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-08-13 10:18:59,352 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-13 10:18:59,352 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-13 10:18:59,352 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-13 10:19:00,347 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L780-->L787: Formula: (let ((.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse11 (= 0 (mod v_~a$w_buff0_used~0_455 256))) (.cse13 (= (mod v_~a$r_buff0_thd2~0_70 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd2~0_52 256) 0)) (.cse14 (= 0 (mod v_~a$w_buff1_used~0_364 256)))) (let ((.cse1 (or .cse10 .cse14)) (.cse2 (not .cse14)) (.cse6 (or .cse11 .cse13)) (.cse0 (or .cse12 .cse13)) (.cse4 (not .cse13)) (.cse5 (not .cse12)) (.cse7 (not .cse11)) (.cse3 (not .cse10))) (and (or (and .cse0 (= v_~a~0_166 |v_P1_#t~ite11_49|) (or (and (= v_~a~0_167 |v_P1_#t~ite11_49|) .cse1) (and .cse2 .cse3 (= |v_P1_#t~ite11_49| v_~a$w_buff1~0_116)))) (and (= v_~a~0_166 v_~a$w_buff0~0_109) .cse4 (= |v_P1_#t~ite11_49| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse5)) (or (and (= v_~a$w_buff1_used~0_364 v_~a$w_buff1_used~0_363) .cse1 .cse6) (and (or (and .cse4 .cse7) (and .cse2 .cse3)) (= v_~a$w_buff1_used~0_363 0))) (or (and .cse4 .cse7 (= v_~a$r_buff0_thd2~0_69 0)) (and (= v_~a$r_buff0_thd2~0_69 v_~a$r_buff0_thd2~0_70) .cse6)) (or (and .cse0 (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455)) (and .cse4 .cse5 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse9 (= 0 (mod v_~a$w_buff1_used~0_363 256))) (.cse8 (= (mod v_~a$r_buff0_thd2~0_69 256) 0))) (or (and (or (and .cse7 (not .cse8)) (and (not .cse9) .cse3)) (= v_~a$r_buff1_thd2~0_51 0)) (and (or .cse10 .cse9) (or .cse11 .cse8) (= v_~a$r_buff1_thd2~0_52 v_~a$r_buff1_thd2~0_51))))))) InVars {~a~0=v_~a~0_167, ~a$w_buff1~0=v_~a$w_buff1~0_116, ~a$w_buff0~0=v_~a$w_buff0~0_109, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_52, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_70, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_364} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_69, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~a~0=v_~a~0_166, ~a$w_buff1~0=v_~a$w_buff1~0_116, ~a$w_buff0~0=v_~a$w_buff0~0_109, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_363} AuxVars[|v_P1_#t~ite11_49|] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, ~a$w_buff1_used~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][66], [131#L767true, 37#L787true, 165#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 134#true, 136#true, 138#true, 236#(= ~y~0 1), 140#true, 141#true, 17#L18-5true, 275#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 147#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 213#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 86#L840true, 27#L807true, 189#(or (not (= 2 ~x~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2021-08-13 10:19:00,347 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-08-13 10:19:00,347 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-08-13 10:19:00,347 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-08-13 10:19:00,347 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-08-13 10:19:02,809 INFO L129 PetriNetUnfolder]: 30651/96996 cut-off events. [2021-08-13 10:19:02,809 INFO L130 PetriNetUnfolder]: For 47406/107454 co-relation queries the response was YES. [2021-08-13 10:19:03,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272117 conditions, 96996 events. 30651/96996 cut-off events. For 47406/107454 co-relation queries the response was YES. Maximal size of possible extension queue 8356. Compared 1596442 event pairs, 11767 based on Foata normal form. 480/90792 useless extension candidates. Maximal degree in co-relation 272033. Up to 26950 conditions per place. [2021-08-13 10:19:03,730 INFO L132 encePairwiseOnDemand]: 120/126 looper letters, 522 selfloop transitions, 252 changer transitions 297/1771 dead transitions. [2021-08-13 10:19:03,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1771 transitions, 22560 flow [2021-08-13 10:19:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 10:19:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 10:19:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1047 transitions. [2021-08-13 10:19:03,733 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9232804232804233 [2021-08-13 10:19:03,733 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1047 transitions. [2021-08-13 10:19:03,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1047 transitions. [2021-08-13 10:19:03,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:19:03,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1047 transitions. [2021-08-13 10:19:03,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.33333333333333) internal successors, (1047), 9 states have internal predecessors, (1047), 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 10:19:03,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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 10:19:03,736 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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 10:19:03,737 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 64 predicate places. [2021-08-13 10:19:03,737 INFO L482 AbstractCegarLoop]: Abstraction has has 197 places, 1771 transitions, 22560 flow [2021-08-13 10:19:03,737 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 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 10:19:03,737 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:19:03,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:19:03,737 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 10:19:03,737 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:19:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:19:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1137895318, now seen corresponding path program 1 times [2021-08-13 10:19:03,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:19:03,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424025786] [2021-08-13 10:19:03,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:19:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:19:03,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:03,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:19:03,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:03,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:19:03,805 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:19:03,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:19:03,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:03,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:19:03,825 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:19:03,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:19:03,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:03,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:19:03,833 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 10:19:03,833 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:19:03,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424025786] [2021-08-13 10:19:03,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424025786] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:19:03,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:19:03,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:19:03,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675101377] [2021-08-13 10:19:03,834 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:19:03,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:19:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:19:03,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:19:03,835 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 126 [2021-08-13 10:19:03,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1771 transitions, 22560 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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 10:19:03,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:19:03,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 126 [2021-08-13 10:19:03,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:19:31,092 INFO L129 PetriNetUnfolder]: 33972/106473 cut-off events. [2021-08-13 10:19:31,092 INFO L130 PetriNetUnfolder]: For 39255/51136 co-relation queries the response was YES. [2021-08-13 10:19:31,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290204 conditions, 106473 events. 33972/106473 cut-off events. For 39255/51136 co-relation queries the response was YES. Maximal size of possible extension queue 6212. Compared 1722682 event pairs, 7397 based on Foata normal form. 387/100000 useless extension candidates. Maximal degree in co-relation 290117. Up to 18982 conditions per place. [2021-08-13 10:19:32,051 INFO L132 encePairwiseOnDemand]: 115/126 looper letters, 29 selfloop transitions, 20 changer transitions 271/1314 dead transitions. [2021-08-13 10:19:32,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1314 transitions, 16116 flow [2021-08-13 10:19:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 10:19:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 10:19:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1161 transitions. [2021-08-13 10:19:32,054 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9214285714285714 [2021-08-13 10:19:32,054 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1161 transitions. [2021-08-13 10:19:32,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1161 transitions. [2021-08-13 10:19:32,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:19:32,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1161 transitions. [2021-08-13 10:19:32,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.1) internal successors, (1161), 10 states have internal predecessors, (1161), 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 10:19:32,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 126.0) internal successors, (1386), 11 states have internal predecessors, (1386), 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 10:19:32,058 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 126.0) internal successors, (1386), 11 states have internal predecessors, (1386), 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 10:19:32,058 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 73 predicate places. [2021-08-13 10:19:32,058 INFO L482 AbstractCegarLoop]: Abstraction has has 206 places, 1314 transitions, 16116 flow [2021-08-13 10:19:32,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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 10:19:32,058 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:19:32,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:19:32,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 10:19:32,059 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:19:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:19:32,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1976725387, now seen corresponding path program 1 times [2021-08-13 10:19:32,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:19:32,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34327791] [2021-08-13 10:19:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:19:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:19:32,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:32,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:19:32,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:32,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:19:32,096 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-08-13 10:19:32,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 10:19:32,103 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:19:32,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:19:32,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:32,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:19:32,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:32,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:19:32,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:19:32,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:19:32,127 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 10:19:32,127 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:19:32,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34327791] [2021-08-13 10:19:32,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34327791] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:19:32,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:19:32,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:19:32,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380470177] [2021-08-13 10:19:32,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:19:32,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:19:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:19:32,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:19:32,128 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 126 [2021-08-13 10:19:32,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 1314 transitions, 16116 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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 10:19:32,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:19:32,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 126 [2021-08-13 10:19:32,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:20:16,247 INFO L129 PetriNetUnfolder]: 53388/171859 cut-off events. [2021-08-13 10:20:16,247 INFO L130 PetriNetUnfolder]: For 79807/115163 co-relation queries the response was YES. [2021-08-13 10:20:17,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489164 conditions, 171859 events. 53388/171859 cut-off events. For 79807/115163 co-relation queries the response was YES. Maximal size of possible extension queue 10944. Compared 2985467 event pairs, 14027 based on Foata normal form. 1721/162337 useless extension candidates. Maximal degree in co-relation 489071. Up to 32793 conditions per place. [2021-08-13 10:20:17,973 INFO L132 encePairwiseOnDemand]: 114/126 looper letters, 937 selfloop transitions, 510 changer transitions 604/2192 dead transitions. [2021-08-13 10:20:17,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 2192 transitions, 32242 flow [2021-08-13 10:20:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:20:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:20:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1483 transitions. [2021-08-13 10:20:17,976 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9053724053724054 [2021-08-13 10:20:17,980 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1483 transitions. [2021-08-13 10:20:17,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1483 transitions. [2021-08-13 10:20:17,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:20:17,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1483 transitions. [2021-08-13 10:20:17,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.07692307692308) internal successors, (1483), 13 states have internal predecessors, (1483), 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 10:20:17,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:20:17,987 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:20:17,987 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 85 predicate places. [2021-08-13 10:20:17,987 INFO L482 AbstractCegarLoop]: Abstraction has has 218 places, 2192 transitions, 32242 flow [2021-08-13 10:20:17,987 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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 10:20:17,987 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:20:17,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:20:17,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 10:20:17,988 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:20:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:20:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2040697379, now seen corresponding path program 1 times [2021-08-13 10:20:17,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:20:17,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509422845] [2021-08-13 10:20:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:20:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:20:18,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:18,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:20:18,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:18,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:18,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:18,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:18,064 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:20:18,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:20:18,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:18,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:20:18,083 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:20:18,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:20:18,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:18,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:20:18,093 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 10:20:18,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:20:18,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509422845] [2021-08-13 10:20:18,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509422845] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:20:18,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:20:18,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:20:18,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052531108] [2021-08-13 10:20:18,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:20:18,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:20:18,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:20:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:20:18,098 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 126 [2021-08-13 10:20:18,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 2192 transitions, 32242 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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 10:20:18,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:20:18,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 126 [2021-08-13 10:20:18,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:20:44,533 INFO L129 PetriNetUnfolder]: 25595/83628 cut-off events. [2021-08-13 10:20:44,534 INFO L130 PetriNetUnfolder]: For 31490/59279 co-relation queries the response was YES. [2021-08-13 10:20:45,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235688 conditions, 83628 events. 25595/83628 cut-off events. For 31490/59279 co-relation queries the response was YES. Maximal size of possible extension queue 5911. Compared 1328736 event pairs, 2280 based on Foata normal form. 5107/83665 useless extension candidates. Maximal degree in co-relation 235592. Up to 18080 conditions per place. [2021-08-13 10:20:45,400 INFO L132 encePairwiseOnDemand]: 115/126 looper letters, 52 selfloop transitions, 54 changer transitions 690/1283 dead transitions. [2021-08-13 10:20:45,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1283 transitions, 17742 flow [2021-08-13 10:20:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:20:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:20:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1511 transitions. [2021-08-13 10:20:45,404 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9224664224664225 [2021-08-13 10:20:45,404 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1511 transitions. [2021-08-13 10:20:45,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1511 transitions. [2021-08-13 10:20:45,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:20:45,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1511 transitions. [2021-08-13 10:20:45,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.23076923076923) internal successors, (1511), 13 states have internal predecessors, (1511), 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 10:20:45,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:20:45,410 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 126.0) internal successors, (1764), 14 states have internal predecessors, (1764), 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 10:20:45,410 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 97 predicate places. [2021-08-13 10:20:45,410 INFO L482 AbstractCegarLoop]: Abstraction has has 230 places, 1283 transitions, 17742 flow [2021-08-13 10:20:45,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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 10:20:45,411 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:20:45,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:20:45,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 10:20:45,411 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:20:45,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:20:45,411 INFO L82 PathProgramCache]: Analyzing trace with hash 10279123, now seen corresponding path program 1 times [2021-08-13 10:20:45,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:20:45,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362801090] [2021-08-13 10:20:45,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:20:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:20:45,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:45,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:20:45,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:45,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:45,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:45,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:45,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:45,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:45,466 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:20:45,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:20:45,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:45,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:20:45,487 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:20:45,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:20:45,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:45,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:20:45,494 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 10:20:45,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:20:45,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362801090] [2021-08-13 10:20:45,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362801090] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:20:45,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:20:45,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 10:20:45,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993284932] [2021-08-13 10:20:45,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 10:20:45,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:20:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 10:20:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 10:20:45,496 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 126 [2021-08-13 10:20:45,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 1283 transitions, 17742 flow. Second operand has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 states have internal predecessors, (897), 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 10:20:45,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:20:45,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 126 [2021-08-13 10:20:45,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:20:58,086 INFO L129 PetriNetUnfolder]: 20267/58379 cut-off events. [2021-08-13 10:20:58,086 INFO L130 PetriNetUnfolder]: For 18370/49096 co-relation queries the response was YES. [2021-08-13 10:20:58,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182273 conditions, 58379 events. 20267/58379 cut-off events. For 18370/49096 co-relation queries the response was YES. Maximal size of possible extension queue 5942. Compared 878358 event pairs, 658 based on Foata normal form. 5119/59588 useless extension candidates. Maximal degree in co-relation 182174. Up to 15531 conditions per place. [2021-08-13 10:20:58,538 INFO L132 encePairwiseOnDemand]: 115/126 looper letters, 33 selfloop transitions, 106 changer transitions 378/721 dead transitions. [2021-08-13 10:20:58,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 721 transitions, 8628 flow [2021-08-13 10:20:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 10:20:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 10:20:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1861 transitions. [2021-08-13 10:20:58,541 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9231150793650794 [2021-08-13 10:20:58,541 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1861 transitions. [2021-08-13 10:20:58,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1861 transitions. [2021-08-13 10:20:58,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:20:58,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1861 transitions. [2021-08-13 10:20:58,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.3125) internal successors, (1861), 16 states have internal predecessors, (1861), 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 10:20:58,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 126.0) internal successors, (2142), 17 states have internal predecessors, (2142), 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 10:20:58,547 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 126.0) internal successors, (2142), 17 states have internal predecessors, (2142), 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 10:20:58,547 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 103 predicate places. [2021-08-13 10:20:58,547 INFO L482 AbstractCegarLoop]: Abstraction has has 236 places, 721 transitions, 8628 flow [2021-08-13 10:20:58,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 states have internal predecessors, (897), 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 10:20:58,548 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:20:58,548 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, 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 10:20:58,548 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 10:20:58,548 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:20:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:20:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1428813696, now seen corresponding path program 1 times [2021-08-13 10:20:58,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:20:58,548 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48005569] [2021-08-13 10:20:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:20:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:20:58,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:58,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:20:58,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:58,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:58,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:58,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:58,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:58,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:58,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:58,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:20:58,617 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:20:58,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:20:58,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:58,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:20:58,639 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:20:58,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:20:58,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:20:58,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:20:58,647 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 10:20:58,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:20:58,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48005569] [2021-08-13 10:20:58,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48005569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:20:58,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:20:58,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 10:20:58,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515581086] [2021-08-13 10:20:58,647 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 10:20:58,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:20:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 10:20:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-13 10:20:58,649 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 126 [2021-08-13 10:20:58,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 721 transitions, 8628 flow. Second operand has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 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 10:20:58,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:20:58,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 126 [2021-08-13 10:20:58,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:21:07,508 INFO L129 PetriNetUnfolder]: 19846/54384 cut-off events. [2021-08-13 10:21:07,509 INFO L130 PetriNetUnfolder]: For 25093/59869 co-relation queries the response was YES. [2021-08-13 10:21:07,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204367 conditions, 54384 events. 19846/54384 cut-off events. For 25093/59869 co-relation queries the response was YES. Maximal size of possible extension queue 5942. Compared 818553 event pairs, 585 based on Foata normal form. 5097/55749 useless extension candidates. Maximal degree in co-relation 204265. Up to 15229 conditions per place. [2021-08-13 10:21:07,929 INFO L132 encePairwiseOnDemand]: 115/126 looper letters, 28 selfloop transitions, 111 changer transitions 186/485 dead transitions. [2021-08-13 10:21:07,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 485 transitions, 5140 flow [2021-08-13 10:21:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 10:21:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 10:21:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2191 transitions. [2021-08-13 10:21:07,932 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9152046783625731 [2021-08-13 10:21:07,932 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2191 transitions. [2021-08-13 10:21:07,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2191 transitions. [2021-08-13 10:21:07,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:21:07,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2191 transitions. [2021-08-13 10:21:07,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 115.3157894736842) internal successors, (2191), 19 states have internal predecessors, (2191), 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 10:21:07,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 126.0) internal successors, (2520), 20 states have internal predecessors, (2520), 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 10:21:07,938 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 126.0) internal successors, (2520), 20 states have internal predecessors, (2520), 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 10:21:07,938 INFO L348 CegarLoopForPetriNet]: 133 programPoint places, 100 predicate places. [2021-08-13 10:21:07,938 INFO L482 AbstractCegarLoop]: Abstraction has has 233 places, 485 transitions, 5140 flow [2021-08-13 10:21:07,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 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 10:21:07,939 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:21:07,939 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, 1, 1, 1, 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 10:21:07,939 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 10:21:07,939 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:21:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:21:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1529221264, now seen corresponding path program 1 times [2021-08-13 10:21:07,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:21:07,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418025860] [2021-08-13 10:21:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:21:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 10:21:07,977 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 10:21:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 10:21:08,022 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 10:21:08,051 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 10:21:08,052 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 10:21:08,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 10:21:08,054 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 10:21:08,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 10:21:08 BasicIcfg [2021-08-13 10:21:08,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 10:21:08,173 INFO L168 Benchmark]: Toolchain (without parser) took 174874.21 ms. Allocated memory was 191.9 MB in the beginning and 6.9 GB in the end (delta: 6.7 GB). Free memory was 156.0 MB in the beginning and 4.7 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 8.0 GB. [2021-08-13 10:21:08,173 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 191.9 MB. Free memory was 174.7 MB in the beginning and 174.5 MB in the end (delta: 113.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 10:21:08,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.88 ms. Allocated memory is still 191.9 MB. Free memory was 155.8 MB in the beginning and 150.1 MB in the end (delta: 5.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-13 10:21:08,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.35 ms. Allocated memory is still 191.9 MB. Free memory was 150.1 MB in the beginning and 147.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:21:08,174 INFO L168 Benchmark]: Boogie Preprocessor took 34.16 ms. Allocated memory is still 191.9 MB. Free memory was 147.5 MB in the beginning and 145.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:21:08,174 INFO L168 Benchmark]: RCFGBuilder took 1758.96 ms. Allocated memory was 191.9 MB in the beginning and 230.7 MB in the end (delta: 38.8 MB). Free memory was 145.1 MB in the beginning and 196.7 MB in the end (delta: -51.6 MB). Peak memory consumption was 109.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:21:08,174 INFO L168 Benchmark]: TraceAbstraction took 172508.63 ms. Allocated memory was 230.7 MB in the beginning and 6.9 GB in the end (delta: 6.7 GB). Free memory was 196.2 MB in the beginning and 4.7 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 8.0 GB. [2021-08-13 10:21:08,175 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 191.9 MB. Free memory was 174.7 MB in the beginning and 174.5 MB in the end (delta: 113.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 509.88 ms. Allocated memory is still 191.9 MB. Free memory was 155.8 MB in the beginning and 150.1 MB in the end (delta: 5.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 57.35 ms. Allocated memory is still 191.9 MB. Free memory was 150.1 MB in the beginning and 147.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.16 ms. Allocated memory is still 191.9 MB. Free memory was 147.5 MB in the beginning and 145.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1758.96 ms. Allocated memory was 191.9 MB in the beginning and 230.7 MB in the end (delta: 38.8 MB). Free memory was 145.1 MB in the beginning and 196.7 MB in the end (delta: -51.6 MB). Peak memory consumption was 109.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 172508.63 ms. Allocated memory was 230.7 MB in the beginning and 6.9 GB in the end (delta: 6.7 GB). Free memory was 196.2 MB in the beginning and 4.7 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.2 GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0] [L716] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L717] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L718] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L719] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L720] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L721] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L722] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L723] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L724] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L725] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L726] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L727] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L728] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L729] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L730] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L731] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L732] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L733] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L734] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L736] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t1513; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t1514; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L861] 0 pthread_t t1515; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L863] 0 pthread_t t1516; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L824] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L824] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L825] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L826] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L827] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L828] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L802] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L802] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L802] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L835] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L835] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L835] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L870] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 172262.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 170619.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 50.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 337 SDtfs, 665 SDslu, 991 SDs, 0 SdLazy, 774 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 707.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1381.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=32242occurred in iteration=9, InterpolantAutomatonStates: 144, 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: 52.7ms SsaConstructionTime, 342.3ms SatisfiabilityAnalysisTime, 948.2ms InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 948 ConstructedInterpolants, 0 QuantifiedInterpolants, 3288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...