/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-CovSimpl.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 05:09:33,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 05:09:33,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 05:09:33,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 05:09:33,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 05:09:33,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 05:09:33,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 05:09:33,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 05:09:33,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 05:09:33,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 05:09:33,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 05:09:33,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 05:09:33,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 05:09:33,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 05:09:33,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 05:09:33,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 05:09:33,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 05:09:33,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 05:09:33,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 05:09:33,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 05:09:33,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 05:09:33,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 05:09:33,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 05:09:33,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 05:09:33,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 05:09:33,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 05:09:33,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 05:09:33,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 05:09:33,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 05:09:33,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 05:09:33,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 05:09:33,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 05:09:33,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 05:09:33,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 05:09:33,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 05:09:33,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 05:09:33,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 05:09:33,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 05:09:33,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 05:09:33,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 05:09:33,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 05:09:33,577 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-CovSimpl.epf [2021-08-13 05:09:33,605 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 05:09:33,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 05:09:33,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 05:09:33,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 05:09:33,608 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 05:09:33,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 05:09:33,608 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 05:09:33,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 05:09:33,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 05:09:33,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 05:09:33,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 05:09:33,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 05:09:33,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 05:09:33,610 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 05:09:33,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 05:09:33,610 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 05:09:33,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 05:09:33,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 05:09:33,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 05:09:33,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 05:09:33,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 05:09:33,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 05:09:33,611 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 05:09:33,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 05:09:33,612 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=true 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 05:09:33,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 05:09:33,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 05:09:33,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 05:09:33,886 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 05:09:33,886 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 05:09:33,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-08-13 05:09:33,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc815572/1b30ab8d1e4f4b22bc684ed6aea8f2a5/FLAG9a85916c1 [2021-08-13 05:09:34,341 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 05:09:34,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-08-13 05:09:34,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc815572/1b30ab8d1e4f4b22bc684ed6aea8f2a5/FLAG9a85916c1 [2021-08-13 05:09:34,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc815572/1b30ab8d1e4f4b22bc684ed6aea8f2a5 [2021-08-13 05:09:34,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 05:09:34,366 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 05:09:34,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 05:09:34,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 05:09:34,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 05:09:34,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4239c058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34, skipping insertion in model container [2021-08-13 05:09:34,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 05:09:34,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 05:09:34,489 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/mix054_pso.opt.i[948,961] [2021-08-13 05:09:34,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 05:09:34,690 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 05:09:34,701 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/mix054_pso.opt.i[948,961] [2021-08-13 05:09:34,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 05:09:34,799 INFO L208 MainTranslator]: Completed translation [2021-08-13 05:09:34,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34 WrapperNode [2021-08-13 05:09:34,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 05:09:34,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 05:09:34,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 05:09:34,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 05:09:34,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 05:09:34,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 05:09:34,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 05:09:34,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 05:09:34,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (1/1) ... [2021-08-13 05:09:34,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 05:09:34,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 05:09:34,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 05:09:34,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 05:09:34,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (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 05:09:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 05:09:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 05:09:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 05:09:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 05:09:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 05:09:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 05:09:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 05:09:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 05:09:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 05:09:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 05:09:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 05:09:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 05:09:34,991 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 05:09:36,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 05:09:36,202 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 05:09:36,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:09:36 BoogieIcfgContainer [2021-08-13 05:09:36,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 05:09:36,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 05:09:36,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 05:09:36,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 05:09:36,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 05:09:34" (1/3) ... [2021-08-13 05:09:36,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62eed26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 05:09:36, skipping insertion in model container [2021-08-13 05:09:36,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 05:09:34" (2/3) ... [2021-08-13 05:09:36,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62eed26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 05:09:36, skipping insertion in model container [2021-08-13 05:09:36,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:09:36" (3/3) ... [2021-08-13 05:09:36,211 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2021-08-13 05:09:36,217 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 05:09:36,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 05:09:36,218 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 05:09:36,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,241 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,241 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,259 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,259 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 05:09:36,260 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 05:09:36,276 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-13 05:09:36,298 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 05:09:36,298 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 05:09:36,298 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 05:09:36,299 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 05:09:36,299 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 05:09:36,299 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 05:09:36,299 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 05:09:36,299 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 05:09:36,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2021-08-13 05:09:36,341 INFO L129 PetriNetUnfolder]: 2/84 cut-off events. [2021-08-13 05:09:36,342 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:09:36,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-08-13 05:09:36,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2021-08-13 05:09:36,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2021-08-13 05:09:36,366 INFO L129 PetriNetUnfolder]: 0/53 cut-off events. [2021-08-13 05:09:36,368 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:09:36,368 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:36,369 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] [2021-08-13 05:09:36,370 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1107007031, now seen corresponding path program 1 times [2021-08-13 05:09:36,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:36,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104437045] [2021-08-13 05:09:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:09:36,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:36,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:36,572 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 05:09:36,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:09:36,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104437045] [2021-08-13 05:09:36,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104437045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:09:36,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:09:36,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 05:09:36,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676592480] [2021-08-13 05:09:36,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 05:09:36,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:09:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 05:09:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 05:09:36,588 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 86 [2021-08-13 05:09:36,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 05:09:36,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:09:36,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 86 [2021-08-13 05:09:36,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:09:36,666 INFO L129 PetriNetUnfolder]: 16/144 cut-off events. [2021-08-13 05:09:36,666 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 05:09:36,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 144 events. 16/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 362 event pairs, 2 based on Foata normal form. 7/144 useless extension candidates. Maximal degree in co-relation 143. Up to 27 conditions per place. [2021-08-13 05:09:36,669 INFO L132 encePairwiseOnDemand]: 81/86 looper letters, 7 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2021-08-13 05:09:36,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 190 flow [2021-08-13 05:09:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 05:09:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 05:09:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2021-08-13 05:09:36,680 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2021-08-13 05:09:36,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2021-08-13 05:09:36,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2021-08-13 05:09:36,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:09:36,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2021-08-13 05:09:36,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 05:09:36,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 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 05:09:36,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 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 05:09:36,693 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 0 predicate places. [2021-08-13 05:09:36,693 INFO L482 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 190 flow [2021-08-13 05:09:36,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 05:09:36,694 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:36,694 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] [2021-08-13 05:09:36,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 05:09:36,694 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash 850422234, now seen corresponding path program 1 times [2021-08-13 05:09:36,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:36,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455466931] [2021-08-13 05:09:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:09:36,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:36,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:36,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:09:36,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:09:36,937 INFO L142 QuantifierPusher]: treesize reduction 14, result has 48.1 percent of original size [2021-08-13 05:09:36,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:09:36,944 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:09:36,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:09:36,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:36,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:36,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:36,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:36,986 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 05:09:36,986 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:09:36,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455466931] [2021-08-13 05:09:36,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455466931] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:09:36,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:09:36,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 05:09:36,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547976883] [2021-08-13 05:09:36,988 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 05:09:36,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:09:36,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 05:09:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 05:09:36,990 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 86 [2021-08-13 05:09:36,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 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 05:09:36,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:09:36,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 86 [2021-08-13 05:09:36,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:09:37,248 INFO L129 PetriNetUnfolder]: 130/474 cut-off events. [2021-08-13 05:09:37,248 INFO L130 PetriNetUnfolder]: For 96/147 co-relation queries the response was YES. [2021-08-13 05:09:37,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 474 events. 130/474 cut-off events. For 96/147 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2600 event pairs, 20 based on Foata normal form. 2/462 useless extension candidates. Maximal degree in co-relation 812. Up to 143 conditions per place. [2021-08-13 05:09:37,253 INFO L132 encePairwiseOnDemand]: 75/86 looper letters, 15 selfloop transitions, 9 changer transitions 48/130 dead transitions. [2021-08-13 05:09:37,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 130 transitions, 462 flow [2021-08-13 05:09:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 05:09:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 05:09:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1000 transitions. [2021-08-13 05:09:37,261 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8305647840531561 [2021-08-13 05:09:37,261 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1000 transitions. [2021-08-13 05:09:37,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1000 transitions. [2021-08-13 05:09:37,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:09:37,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1000 transitions. [2021-08-13 05:09:37,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 71.42857142857143) internal successors, (1000), 14 states have internal predecessors, (1000), 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 05:09:37,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 86.0) internal successors, (1290), 15 states have internal predecessors, (1290), 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 05:09:37,271 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 86.0) internal successors, (1290), 15 states have internal predecessors, (1290), 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 05:09:37,271 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 13 predicate places. [2021-08-13 05:09:37,271 INFO L482 AbstractCegarLoop]: Abstraction has has 102 places, 130 transitions, 462 flow [2021-08-13 05:09:37,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 68.25) internal successors, (546), 8 states have internal predecessors, (546), 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 05:09:37,272 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:37,272 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] [2021-08-13 05:09:37,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 05:09:37,272 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:37,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash -138801092, now seen corresponding path program 1 times [2021-08-13 05:09:37,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:37,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37099406] [2021-08-13 05:09:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:09:37,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:37,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:37,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:37,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:37,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:37,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:09:37,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:37,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:09:37,389 INFO L142 QuantifierPusher]: treesize reduction 37, result has 41.3 percent of original size [2021-08-13 05:09:37,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-08-13 05:09:37,398 INFO L142 QuantifierPusher]: treesize reduction 27, result has 69.0 percent of original size [2021-08-13 05:09:37,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-08-13 05:09:37,425 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:09:37,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:09:37,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:37,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:37,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:37,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:37,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:37,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:37,455 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 05:09:37,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:09:37,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37099406] [2021-08-13 05:09:37,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37099406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:09:37,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:09:37,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 05:09:37,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189035208] [2021-08-13 05:09:37,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 05:09:37,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:09:37,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 05:09:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-13 05:09:37,458 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 86 [2021-08-13 05:09:37,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 130 transitions, 462 flow. Second operand has 9 states, 9 states have (on average 67.33333333333333) internal successors, (606), 9 states have internal predecessors, (606), 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 05:09:37,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:09:37,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 86 [2021-08-13 05:09:37,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:09:37,896 INFO L129 PetriNetUnfolder]: 148/572 cut-off events. [2021-08-13 05:09:37,896 INFO L130 PetriNetUnfolder]: For 145/293 co-relation queries the response was YES. [2021-08-13 05:09:37,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 572 events. 148/572 cut-off events. For 145/293 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3513 event pairs, 22 based on Foata normal form. 10/569 useless extension candidates. Maximal degree in co-relation 1254. Up to 185 conditions per place. [2021-08-13 05:09:37,898 INFO L132 encePairwiseOnDemand]: 75/86 looper letters, 16 selfloop transitions, 10 changer transitions 73/156 dead transitions. [2021-08-13 05:09:37,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 156 transitions, 772 flow [2021-08-13 05:09:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 05:09:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 05:09:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1052 transitions. [2021-08-13 05:09:37,901 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8155038759689922 [2021-08-13 05:09:37,901 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1052 transitions. [2021-08-13 05:09:37,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1052 transitions. [2021-08-13 05:09:37,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:09:37,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1052 transitions. [2021-08-13 05:09:37,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 70.13333333333334) internal successors, (1052), 15 states have internal predecessors, (1052), 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 05:09:37,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 86.0) internal successors, (1376), 16 states have internal predecessors, (1376), 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 05:09:37,908 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 86.0) internal successors, (1376), 16 states have internal predecessors, (1376), 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 05:09:37,908 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 27 predicate places. [2021-08-13 05:09:37,908 INFO L482 AbstractCegarLoop]: Abstraction has has 116 places, 156 transitions, 772 flow [2021-08-13 05:09:37,908 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 67.33333333333333) internal successors, (606), 9 states have internal predecessors, (606), 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 05:09:37,908 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:37,908 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:09:37,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 05:09:37,909 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash 566277441, now seen corresponding path program 1 times [2021-08-13 05:09:37,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:37,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111257740] [2021-08-13 05:09:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:09:38,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:38,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:38,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:09:38,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 05:09:38,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 05:09:38,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 05:09:38,084 INFO L142 QuantifierPusher]: treesize reduction 29, result has 77.2 percent of original size [2021-08-13 05:09:38,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-08-13 05:09:38,111 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:09:38,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:09:38,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:38,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:38,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:38,150 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 05:09:38,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:09:38,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111257740] [2021-08-13 05:09:38,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111257740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:09:38,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:09:38,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 05:09:38,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579692781] [2021-08-13 05:09:38,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 05:09:38,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:09:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 05:09:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-13 05:09:38,156 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2021-08-13 05:09:38,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 156 transitions, 772 flow. Second operand has 11 states, 11 states have (on average 66.18181818181819) internal successors, (728), 11 states have internal predecessors, (728), 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 05:09:38,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:09:38,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2021-08-13 05:09:38,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:09:38,575 INFO L129 PetriNetUnfolder]: 161/650 cut-off events. [2021-08-13 05:09:38,576 INFO L130 PetriNetUnfolder]: For 292/502 co-relation queries the response was YES. [2021-08-13 05:09:38,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 650 events. 161/650 cut-off events. For 292/502 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4256 event pairs, 13 based on Foata normal form. 14/655 useless extension candidates. Maximal degree in co-relation 1725. Up to 224 conditions per place. [2021-08-13 05:09:38,578 INFO L132 encePairwiseOnDemand]: 75/86 looper letters, 19 selfloop transitions, 9 changer transitions 113/197 dead transitions. [2021-08-13 05:09:38,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 197 transitions, 1328 flow [2021-08-13 05:09:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 05:09:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 05:09:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1174 transitions. [2021-08-13 05:09:38,581 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8030095759233926 [2021-08-13 05:09:38,581 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1174 transitions. [2021-08-13 05:09:38,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1174 transitions. [2021-08-13 05:09:38,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:09:38,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1174 transitions. [2021-08-13 05:09:38,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 69.05882352941177) internal successors, (1174), 17 states have internal predecessors, (1174), 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 05:09:38,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 86.0) internal successors, (1548), 18 states have internal predecessors, (1548), 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 05:09:38,585 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 86.0) internal successors, (1548), 18 states have internal predecessors, (1548), 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 05:09:38,585 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 43 predicate places. [2021-08-13 05:09:38,586 INFO L482 AbstractCegarLoop]: Abstraction has has 132 places, 197 transitions, 1328 flow [2021-08-13 05:09:38,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 66.18181818181819) internal successors, (728), 11 states have internal predecessors, (728), 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 05:09:38,586 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:38,586 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] [2021-08-13 05:09:38,586 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 05:09:38,586 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1113826109, now seen corresponding path program 1 times [2021-08-13 05:09:38,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:38,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835865979] [2021-08-13 05:09:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:09:38,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:38,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:38,635 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:09:38,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:09:38,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:09:38,651 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:09:38,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:38,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:38,658 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 05:09:38,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:09:38,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835865979] [2021-08-13 05:09:38,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835865979] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:09:38,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:09:38,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 05:09:38,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186998475] [2021-08-13 05:09:38,658 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 05:09:38,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:09:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 05:09:38,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 05:09:38,659 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 86 [2021-08-13 05:09:38,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 197 transitions, 1328 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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 05:09:38,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:09:38,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 86 [2021-08-13 05:09:38,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:09:38,767 INFO L129 PetriNetUnfolder]: 73/359 cut-off events. [2021-08-13 05:09:38,768 INFO L130 PetriNetUnfolder]: For 128/149 co-relation queries the response was YES. [2021-08-13 05:09:38,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 359 events. 73/359 cut-off events. For 128/149 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1806 event pairs, 10 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 761. Up to 95 conditions per place. [2021-08-13 05:09:38,769 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 13 selfloop transitions, 12 changer transitions 23/125 dead transitions. [2021-08-13 05:09:38,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 125 transitions, 586 flow [2021-08-13 05:09:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 05:09:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 05:09:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 765 transitions. [2021-08-13 05:09:38,771 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2021-08-13 05:09:38,771 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 765 transitions. [2021-08-13 05:09:38,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 765 transitions. [2021-08-13 05:09:38,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:09:38,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 765 transitions. [2021-08-13 05:09:38,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.5) internal successors, (765), 10 states have internal predecessors, (765), 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 05:09:38,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 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 05:09:38,777 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 86.0) internal successors, (946), 11 states have internal predecessors, (946), 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 05:09:38,777 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2021-08-13 05:09:38,777 INFO L482 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 586 flow [2021-08-13 05:09:38,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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 05:09:38,778 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:38,778 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] [2021-08-13 05:09:38,778 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 05:09:38,778 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:38,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1093820227, now seen corresponding path program 1 times [2021-08-13 05:09:38,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:38,779 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749226934] [2021-08-13 05:09:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:09:38,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:38,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:38,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:38,863 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 05:09:38,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 05:09:38,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 05:09:38,881 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 05:09:38,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:38,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:38,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:38,887 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 05:09:38,888 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:09:38,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749226934] [2021-08-13 05:09:38,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749226934] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:09:38,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:09:38,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:09:38,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443449239] [2021-08-13 05:09:38,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:09:38,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:09:38,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:09:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:09:38,890 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 86 [2021-08-13 05:09:38,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 586 flow. Second operand has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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 05:09:38,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:09:38,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 86 [2021-08-13 05:09:38,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:09:39,041 INFO L129 PetriNetUnfolder]: 39/221 cut-off events. [2021-08-13 05:09:39,041 INFO L130 PetriNetUnfolder]: For 74/181 co-relation queries the response was YES. [2021-08-13 05:09:39,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 221 events. 39/221 cut-off events. For 74/181 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 940 event pairs, 0 based on Foata normal form. 25/236 useless extension candidates. Maximal degree in co-relation 457. Up to 33 conditions per place. [2021-08-13 05:09:39,042 INFO L132 encePairwiseOnDemand]: 77/86 looper letters, 12 selfloop transitions, 15 changer transitions 31/126 dead transitions. [2021-08-13 05:09:39,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 610 flow [2021-08-13 05:09:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 05:09:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 05:09:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 985 transitions. [2021-08-13 05:09:39,044 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8810375670840788 [2021-08-13 05:09:39,045 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 985 transitions. [2021-08-13 05:09:39,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 985 transitions. [2021-08-13 05:09:39,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:09:39,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 985 transitions. [2021-08-13 05:09:39,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 75.76923076923077) internal successors, (985), 13 states have internal predecessors, (985), 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 05:09:39,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 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 05:09:39,048 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 86.0) internal successors, (1204), 14 states have internal predecessors, (1204), 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 05:09:39,048 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 37 predicate places. [2021-08-13 05:09:39,048 INFO L482 AbstractCegarLoop]: Abstraction has has 126 places, 126 transitions, 610 flow [2021-08-13 05:09:39,048 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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 05:09:39,048 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:39,049 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 05:09:39,049 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 05:09:39,049 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2061416515, now seen corresponding path program 1 times [2021-08-13 05:09:39,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:39,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439881168] [2021-08-13 05:09:39,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 05:09:39,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:39,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:39,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:39,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:39,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:39,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 05:09:39,100 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 05:09:39,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 05:09:39,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:39,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:39,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:39,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 05:09:39,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 05:09:39,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 05:09:39,128 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 05:09:39,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 05:09:39,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439881168] [2021-08-13 05:09:39,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439881168] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 05:09:39,128 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 05:09:39,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 05:09:39,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556671851] [2021-08-13 05:09:39,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 05:09:39,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 05:09:39,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 05:09:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 05:09:39,131 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 86 [2021-08-13 05:09:39,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 126 transitions, 610 flow. Second operand has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 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 05:09:39,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 05:09:39,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 86 [2021-08-13 05:09:39,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 05:09:39,213 INFO L129 PetriNetUnfolder]: 76/381 cut-off events. [2021-08-13 05:09:39,213 INFO L130 PetriNetUnfolder]: For 117/162 co-relation queries the response was YES. [2021-08-13 05:09:39,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 381 events. 76/381 cut-off events. For 117/162 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2279 event pairs, 1 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 872. Up to 65 conditions per place. [2021-08-13 05:09:39,215 INFO L132 encePairwiseOnDemand]: 80/86 looper letters, 9 selfloop transitions, 1 changer transitions 41/132 dead transitions. [2021-08-13 05:09:39,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 132 transitions, 688 flow [2021-08-13 05:09:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 05:09:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 05:09:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2021-08-13 05:09:39,216 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.867109634551495 [2021-08-13 05:09:39,216 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 522 transitions. [2021-08-13 05:09:39,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 522 transitions. [2021-08-13 05:09:39,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 05:09:39,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 522 transitions. [2021-08-13 05:09:39,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 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 05:09:39,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 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 05:09:39,218 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 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 05:09:39,218 INFO L348 CegarLoopForPetriNet]: 89 programPoint places, 43 predicate places. [2021-08-13 05:09:39,219 INFO L482 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 688 flow [2021-08-13 05:09:39,219 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 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 05:09:39,219 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 05:09:39,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] [2021-08-13 05:09:39,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 05:09:39,219 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 05:09:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 05:09:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash -634199703, now seen corresponding path program 2 times [2021-08-13 05:09:39,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 05:09:39,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15541230] [2021-08-13 05:09:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 05:09:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 05:09:39,255 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 05:09:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 05:09:39,285 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 05:09:39,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 05:09:39,317 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 05:09:39,317 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 05:09:39,319 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 05:09:39,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 05:09:39 BasicIcfg [2021-08-13 05:09:39,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 05:09:39,391 INFO L168 Benchmark]: Toolchain (without parser) took 5022.68 ms. Allocated memory was 198.2 MB in the beginning and 271.6 MB in the end (delta: 73.4 MB). Free memory was 161.5 MB in the beginning and 127.7 MB in the end (delta: 33.8 MB). Peak memory consumption was 108.5 MB. Max. memory is 8.0 GB. [2021-08-13 05:09:39,392 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 198.2 MB. Free memory is still 179.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 05:09:39,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.35 ms. Allocated memory is still 198.2 MB. Free memory was 161.3 MB in the beginning and 157.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 12.5 MB. Max. memory is 8.0 GB. [2021-08-13 05:09:39,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.75 ms. Allocated memory is still 198.2 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 05:09:39,392 INFO L168 Benchmark]: Boogie Preprocessor took 32.60 ms. Allocated memory is still 198.2 MB. Free memory was 155.0 MB in the beginning and 152.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 05:09:39,393 INFO L168 Benchmark]: RCFGBuilder took 1308.44 ms. Allocated memory is still 198.2 MB. Free memory was 152.9 MB in the beginning and 172.6 MB in the end (delta: -19.7 MB). Peak memory consumption was 94.1 MB. Max. memory is 8.0 GB. [2021-08-13 05:09:39,393 INFO L168 Benchmark]: TraceAbstraction took 3182.53 ms. Allocated memory was 198.2 MB in the beginning and 271.6 MB in the end (delta: 73.4 MB). Free memory was 172.1 MB in the beginning and 127.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 118.3 MB. Max. memory is 8.0 GB. [2021-08-13 05:09:39,394 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.10 ms. Allocated memory is still 198.2 MB. Free memory is still 179.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 433.35 ms. Allocated memory is still 198.2 MB. Free memory was 161.3 MB in the beginning and 157.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 12.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 61.75 ms. Allocated memory is still 198.2 MB. Free memory was 157.6 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.60 ms. Allocated memory is still 198.2 MB. Free memory was 155.0 MB in the beginning and 152.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1308.44 ms. Allocated memory is still 198.2 MB. Free memory was 152.9 MB in the beginning and 172.6 MB in the end (delta: -19.7 MB). Peak memory consumption was 94.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3182.53 ms. Allocated memory was 198.2 MB in the beginning and 271.6 MB in the end (delta: 73.4 MB). Free memory was 172.1 MB in the beginning and 127.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 118.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L716] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L717] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L718] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L719] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L720] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L721] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L722] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L723] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L724] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L725] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L726] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L727] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L728] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 16.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3023.2ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1640.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 52.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 280 SDslu, 240 SDs, 0 SdLazy, 410 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 367.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 942.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1328occurred in iteration=4, InterpolantAutomatonStates: 79, 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: 28.9ms SsaConstructionTime, 315.5ms SatisfiabilityAnalysisTime, 769.7ms InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 1863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...