/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-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 15:23:02,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 15:23:02,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 15:23:02,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 15:23:02,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 15:23:02,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 15:23:02,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 15:23:02,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 15:23:02,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 15:23:02,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 15:23:02,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 15:23:02,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 15:23:02,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 15:23:02,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 15:23:02,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 15:23:02,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 15:23:02,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 15:23:02,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 15:23:02,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 15:23:02,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 15:23:02,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 15:23:02,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 15:23:02,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 15:23:02,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 15:23:02,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 15:23:02,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 15:23:02,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 15:23:02,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 15:23:02,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 15:23:02,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 15:23:02,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 15:23:02,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 15:23:02,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 15:23:02,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 15:23:02,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 15:23:02,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 15:23:02,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 15:23:02,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 15:23:02,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 15:23:02,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 15:23:02,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 15:23:02,360 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-Hitting.epf [2021-08-13 15:23:02,388 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 15:23:02,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 15:23:02,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 15:23:02,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 15:23:02,391 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 15:23:02,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 15:23:02,392 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 15:23:02,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 15:23:02,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 15:23:02,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 15:23:02,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 15:23:02,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 15:23:02,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 15:23:02,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 15:23:02,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 15:23:02,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 15:23:02,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 15:23:02,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 15:23:02,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 15:23:02,395 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 15:23:02,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 15:23:02,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 15:23:02,395 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 15:23:02,395 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 15:23:02,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 15:23:02,395 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 15:23:02,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 15:23:02,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 15:23:02,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 15:23:02,676 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 15:23:02,676 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 15:23:02,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-08-13 15:23:02,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7ea4606/da8cb8d6f6cb4bb6a61b9a33213c522a/FLAG788ba6138 [2021-08-13 15:23:03,120 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 15:23:03,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-08-13 15:23:03,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7ea4606/da8cb8d6f6cb4bb6a61b9a33213c522a/FLAG788ba6138 [2021-08-13 15:23:03,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7ea4606/da8cb8d6f6cb4bb6a61b9a33213c522a [2021-08-13 15:23:03,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 15:23:03,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 15:23:03,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 15:23:03,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 15:23:03,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 15:23:03,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:03,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bbe97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03, skipping insertion in model container [2021-08-13 15:23:03,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:03,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 15:23:03,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 15:23:03,668 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-08-13 15:23:03,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:23:03,841 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 15:23:03,853 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i[948,961] [2021-08-13 15:23:03,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:23:03,945 INFO L208 MainTranslator]: Completed translation [2021-08-13 15:23:03,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03 WrapperNode [2021-08-13 15:23:03,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 15:23:03,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 15:23:03,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 15:23:03,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 15:23:03,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:03,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 15:23:04,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 15:23:04,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 15:23:04,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 15:23:04,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (1/1) ... [2021-08-13 15:23:04,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 15:23:04,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 15:23:04,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 15:23:04,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 15:23:04,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (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 15:23:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 15:23:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 15:23:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 15:23:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 15:23:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 15:23:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 15:23:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 15:23:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 15:23:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 15:23:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 15:23:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 15:23:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 15:23:04,129 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 15:23:05,552 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 15:23:05,553 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 15:23:05,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:23:05 BoogieIcfgContainer [2021-08-13 15:23:05,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 15:23:05,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 15:23:05,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 15:23:05,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 15:23:05,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 03:23:03" (1/3) ... [2021-08-13 15:23:05,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477b2f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:23:05, skipping insertion in model container [2021-08-13 15:23:05,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:23:03" (2/3) ... [2021-08-13 15:23:05,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477b2f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:23:05, skipping insertion in model container [2021-08-13 15:23:05,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:23:05" (3/3) ... [2021-08-13 15:23:05,559 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2021-08-13 15:23:05,563 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 15:23:05,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 15:23:05,564 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 15:23:05,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,593 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,593 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,593 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:23:05,597 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 15:23:05,611 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-13 15:23:05,624 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 15:23:05,624 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 15:23:05,624 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 15:23:05,624 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 15:23:05,625 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 15:23:05,625 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 15:23:05,625 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 15:23:05,625 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 15:23:05,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2021-08-13 15:23:05,653 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2021-08-13 15:23:05,653 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:23:05,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2021-08-13 15:23:05,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2021-08-13 15:23:05,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2021-08-13 15:23:05,665 INFO L129 PetriNetUnfolder]: 0/54 cut-off events. [2021-08-13 15:23:05,666 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:23:05,666 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:05,666 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:23:05,666 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 581779579, now seen corresponding path program 1 times [2021-08-13 15:23:05,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:05,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189034546] [2021-08-13 15:23:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:23:05,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:05,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:05,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:05,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:05,838 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 15:23:05,838 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:23:05,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189034546] [2021-08-13 15:23:05,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189034546] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:23:05,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:23:05,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 15:23:05,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949915673] [2021-08-13 15:23:05,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 15:23:05,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:23:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 15:23:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 15:23:05,856 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 89 [2021-08-13 15:23:05,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:05,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:23:05,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 89 [2021-08-13 15:23:05,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:23:05,942 INFO L129 PetriNetUnfolder]: 16/191 cut-off events. [2021-08-13 15:23:05,942 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:23:05,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 191 events. 16/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 604 event pairs, 6 based on Foata normal form. 9/189 useless extension candidates. Maximal degree in co-relation 189. Up to 27 conditions per place. [2021-08-13 15:23:05,946 INFO L132 encePairwiseOnDemand]: 84/89 looper letters, 7 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2021-08-13 15:23:05,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 196 flow [2021-08-13 15:23:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 15:23:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 15:23:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2021-08-13 15:23:05,957 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2021-08-13 15:23:05,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2021-08-13 15:23:05,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2021-08-13 15:23:05,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:23:05,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2021-08-13 15:23:05,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:05,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:05,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:05,971 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 0 predicate places. [2021-08-13 15:23:05,971 INFO L482 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 196 flow [2021-08-13 15:23:05,971 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:05,971 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:05,971 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:23:05,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 15:23:05,972 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:05,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:05,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1072851851, now seen corresponding path program 1 times [2021-08-13 15:23:05,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:05,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453433859] [2021-08-13 15:23:05,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:23:06,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:06,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:06,176 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:23:06,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:23:06,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:06,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:06,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:06,205 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 15:23:06,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:23:06,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453433859] [2021-08-13 15:23:06,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453433859] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:23:06,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:23:06,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:23:06,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433800227] [2021-08-13 15:23:06,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:23:06,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:23:06,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:23:06,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:23:06,208 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 89 [2021-08-13 15:23:06,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:06,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:23:06,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 89 [2021-08-13 15:23:06,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:23:06,346 INFO L129 PetriNetUnfolder]: 30/275 cut-off events. [2021-08-13 15:23:06,346 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-08-13 15:23:06,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 275 events. 30/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1279 event pairs, 6 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 355. Up to 45 conditions per place. [2021-08-13 15:23:06,348 INFO L132 encePairwiseOnDemand]: 83/89 looper letters, 7 selfloop transitions, 2 changer transitions 13/98 dead transitions. [2021-08-13 15:23:06,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 266 flow [2021-08-13 15:23:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 15:23:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 15:23:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2021-08-13 15:23:06,351 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8938826466916354 [2021-08-13 15:23:06,351 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 716 transitions. [2021-08-13 15:23:06,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 716 transitions. [2021-08-13 15:23:06,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:23:06,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 716 transitions. [2021-08-13 15:23:06,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.55555555555556) internal successors, (716), 9 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:06,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:06,355 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:06,355 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2021-08-13 15:23:06,356 INFO L482 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 266 flow [2021-08-13 15:23:06,356 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:06,356 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:06,356 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] [2021-08-13 15:23:06,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 15:23:06,356 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:06,357 INFO L82 PathProgramCache]: Analyzing trace with hash 563975712, now seen corresponding path program 1 times [2021-08-13 15:23:06,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:06,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383505113] [2021-08-13 15:23:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:23:06,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:06,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:06,416 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:23:06,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:23:06,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:06,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:06,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:06,443 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 15:23:06,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:23:06,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383505113] [2021-08-13 15:23:06,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383505113] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:23:06,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:23:06,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:23:06,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694003346] [2021-08-13 15:23:06,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:23:06,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:23:06,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:23:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:23:06,445 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2021-08-13 15:23:06,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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 15:23:06,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:23:06,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2021-08-13 15:23:06,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:23:06,628 INFO L129 PetriNetUnfolder]: 179/967 cut-off events. [2021-08-13 15:23:06,628 INFO L130 PetriNetUnfolder]: For 89/115 co-relation queries the response was YES. [2021-08-13 15:23:06,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 967 events. 179/967 cut-off events. For 89/115 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7912 event pairs, 49 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 1669. Up to 138 conditions per place. [2021-08-13 15:23:06,632 INFO L132 encePairwiseOnDemand]: 83/89 looper letters, 13 selfloop transitions, 2 changer transitions 66/153 dead transitions. [2021-08-13 15:23:06,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 153 transitions, 628 flow [2021-08-13 15:23:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 15:23:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 15:23:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 711 transitions. [2021-08-13 15:23:06,633 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8876404494382022 [2021-08-13 15:23:06,633 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 711 transitions. [2021-08-13 15:23:06,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 711 transitions. [2021-08-13 15:23:06,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:23:06,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 711 transitions. [2021-08-13 15:23:06,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 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 15:23:06,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:06,637 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:06,637 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 16 predicate places. [2021-08-13 15:23:06,637 INFO L482 AbstractCegarLoop]: Abstraction has has 108 places, 153 transitions, 628 flow [2021-08-13 15:23:06,637 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 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 15:23:06,637 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:06,637 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:23:06,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 15:23:06,638 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:06,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash -475562999, now seen corresponding path program 1 times [2021-08-13 15:23:06,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:06,638 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573536348] [2021-08-13 15:23:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:23:06,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:06,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:06,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:23:06,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:23:06,779 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-08-13 15:23:06,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-08-13 15:23:06,802 INFO L142 QuantifierPusher]: treesize reduction 20, result has 80.4 percent of original size [2021-08-13 15:23:06,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 82 [2021-08-13 15:23:06,811 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:23:06,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:23:06,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:06,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:06,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:06,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:06,853 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 15:23:06,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:23:06,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573536348] [2021-08-13 15:23:06,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573536348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:23:06,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:23:06,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 15:23:06,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321393632] [2021-08-13 15:23:06,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 15:23:06,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:23:06,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 15:23:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-13 15:23:06,856 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2021-08-13 15:23:06,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 153 transitions, 628 flow. Second operand has 9 states, 9 states have (on average 69.44444444444444) internal successors, (625), 9 states have internal predecessors, (625), 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 15:23:06,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:23:06,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2021-08-13 15:23:06,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:23:07,831 INFO L129 PetriNetUnfolder]: 1008/3260 cut-off events. [2021-08-13 15:23:07,832 INFO L130 PetriNetUnfolder]: For 1303/1418 co-relation queries the response was YES. [2021-08-13 15:23:07,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7334 conditions, 3260 events. 1008/3260 cut-off events. For 1303/1418 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 30897 event pairs, 224 based on Foata normal form. 6/3219 useless extension candidates. Maximal degree in co-relation 7277. Up to 797 conditions per place. [2021-08-13 15:23:07,858 INFO L132 encePairwiseOnDemand]: 77/89 looper letters, 15 selfloop transitions, 9 changer transitions 238/323 dead transitions. [2021-08-13 15:23:07,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 323 transitions, 2054 flow [2021-08-13 15:23:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 15:23:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 15:23:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1152 transitions. [2021-08-13 15:23:07,871 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8089887640449438 [2021-08-13 15:23:07,871 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1152 transitions. [2021-08-13 15:23:07,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1152 transitions. [2021-08-13 15:23:07,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:23:07,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1152 transitions. [2021-08-13 15:23:07,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 72.0) internal successors, (1152), 16 states have internal predecessors, (1152), 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 15:23:07,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 89.0) internal successors, (1513), 17 states have internal predecessors, (1513), 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 15:23:07,876 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 89.0) internal successors, (1513), 17 states have internal predecessors, (1513), 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 15:23:07,876 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 31 predicate places. [2021-08-13 15:23:07,877 INFO L482 AbstractCegarLoop]: Abstraction has has 123 places, 323 transitions, 2054 flow [2021-08-13 15:23:07,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 69.44444444444444) internal successors, (625), 9 states have internal predecessors, (625), 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 15:23:07,877 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:07,877 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:23:07,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 15:23:07,877 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash -689813475, now seen corresponding path program 2 times [2021-08-13 15:23:07,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:07,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682019916] [2021-08-13 15:23:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:23:08,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:08,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:08,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:23:08,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 15:23:08,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 15:23:08,112 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 15:23:08,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 15:23:08,123 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 15:23:08,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 15:23:08,139 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:23:08,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:23:08,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:08,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:08,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:08,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:08,176 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 15:23:08,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:23:08,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682019916] [2021-08-13 15:23:08,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682019916] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:23:08,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:23:08,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 15:23:08,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585879114] [2021-08-13 15:23:08,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 15:23:08,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:23:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 15:23:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 15:23:08,178 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2021-08-13 15:23:08,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 323 transitions, 2054 flow. Second operand has 10 states, 10 states have (on average 69.3) internal successors, (693), 10 states have internal predecessors, (693), 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 15:23:08,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:23:08,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2021-08-13 15:23:08,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:23:08,919 INFO L129 PetriNetUnfolder]: 1351/4668 cut-off events. [2021-08-13 15:23:08,919 INFO L130 PetriNetUnfolder]: For 2942/3486 co-relation queries the response was YES. [2021-08-13 15:23:08,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12594 conditions, 4668 events. 1351/4668 cut-off events. For 2942/3486 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 49718 event pairs, 102 based on Foata normal form. 100/4718 useless extension candidates. Maximal degree in co-relation 12530. Up to 1152 conditions per place. [2021-08-13 15:23:08,934 INFO L132 encePairwiseOnDemand]: 77/89 looper letters, 15 selfloop transitions, 11 changer transitions 432/519 dead transitions. [2021-08-13 15:23:08,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 519 transitions, 4382 flow [2021-08-13 15:23:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 15:23:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 15:23:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1219 transitions. [2021-08-13 15:23:08,937 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8056840713813616 [2021-08-13 15:23:08,937 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1219 transitions. [2021-08-13 15:23:08,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1219 transitions. [2021-08-13 15:23:08,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:23:08,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1219 transitions. [2021-08-13 15:23:08,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 71.70588235294117) internal successors, (1219), 17 states have internal predecessors, (1219), 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 15:23:08,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 89.0) internal successors, (1602), 18 states have internal predecessors, (1602), 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 15:23:08,943 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 89.0) internal successors, (1602), 18 states have internal predecessors, (1602), 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 15:23:08,943 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 47 predicate places. [2021-08-13 15:23:08,943 INFO L482 AbstractCegarLoop]: Abstraction has has 139 places, 519 transitions, 4382 flow [2021-08-13 15:23:08,943 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 69.3) internal successors, (693), 10 states have internal predecessors, (693), 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 15:23:08,943 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:08,944 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:23:08,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 15:23:08,944 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash -365206636, now seen corresponding path program 1 times [2021-08-13 15:23:08,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:08,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340931462] [2021-08-13 15:23:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:23:09,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:09,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:09,028 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:23:09,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:23:09,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:23:09,046 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:23:09,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:09,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:09,053 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 15:23:09,053 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:23:09,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340931462] [2021-08-13 15:23:09,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340931462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:23:09,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:23:09,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:23:09,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541952051] [2021-08-13 15:23:09,054 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:23:09,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:23:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:23:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:23:09,056 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2021-08-13 15:23:09,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 519 transitions, 4382 flow. Second operand has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:23:09,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2021-08-13 15:23:09,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:23:09,215 INFO L129 PetriNetUnfolder]: 194/916 cut-off events. [2021-08-13 15:23:09,215 INFO L130 PetriNetUnfolder]: For 328/362 co-relation queries the response was YES. [2021-08-13 15:23:09,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 916 events. 194/916 cut-off events. For 328/362 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6795 event pairs, 28 based on Foata normal form. 3/866 useless extension candidates. Maximal degree in co-relation 2114. Up to 256 conditions per place. [2021-08-13 15:23:09,219 INFO L132 encePairwiseOnDemand]: 80/89 looper letters, 13 selfloop transitions, 14 changer transitions 62/168 dead transitions. [2021-08-13 15:23:09,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 926 flow [2021-08-13 15:23:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 15:23:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 15:23:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 795 transitions. [2021-08-13 15:23:09,221 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8932584269662921 [2021-08-13 15:23:09,221 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 795 transitions. [2021-08-13 15:23:09,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 795 transitions. [2021-08-13 15:23:09,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:23:09,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 795 transitions. [2021-08-13 15:23:09,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.5) internal successors, (795), 10 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,224 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,224 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 38 predicate places. [2021-08-13 15:23:09,224 INFO L482 AbstractCegarLoop]: Abstraction has has 130 places, 168 transitions, 926 flow [2021-08-13 15:23:09,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,225 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:09,225 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 15:23:09,225 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 15:23:09,225 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1858029730, now seen corresponding path program 1 times [2021-08-13 15:23:09,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:09,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541394026] [2021-08-13 15:23:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:23:09,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:09,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:09,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:23:09,306 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:23:09,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:23:09,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:23:09,351 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:23:09,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:23:09,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:23:09,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:23:09,374 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 15:23:09,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:23:09,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541394026] [2021-08-13 15:23:09,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541394026] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:23:09,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:23:09,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:23:09,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228377177] [2021-08-13 15:23:09,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:23:09,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:23:09,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:23:09,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:23:09,375 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2021-08-13 15:23:09,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 168 transitions, 926 flow. Second operand has 7 states, 7 states have (on average 77.14285714285714) internal successors, (540), 7 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:23:09,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2021-08-13 15:23:09,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:23:09,523 INFO L129 PetriNetUnfolder]: 87/466 cut-off events. [2021-08-13 15:23:09,523 INFO L130 PetriNetUnfolder]: For 111/494 co-relation queries the response was YES. [2021-08-13 15:23:09,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 466 events. 87/466 cut-off events. For 111/494 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3125 event pairs, 0 based on Foata normal form. 73/505 useless extension candidates. Maximal degree in co-relation 1028. Up to 73 conditions per place. [2021-08-13 15:23:09,525 INFO L132 encePairwiseOnDemand]: 80/89 looper letters, 12 selfloop transitions, 17 changer transitions 38/138 dead transitions. [2021-08-13 15:23:09,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 138 transitions, 692 flow [2021-08-13 15:23:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:23:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:23:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1024 transitions. [2021-08-13 15:23:09,527 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.88504753673293 [2021-08-13 15:23:09,527 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1024 transitions. [2021-08-13 15:23:09,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1024 transitions. [2021-08-13 15:23:09,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:23:09,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1024 transitions. [2021-08-13 15:23:09,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 78.76923076923077) internal successors, (1024), 13 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,530 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,531 INFO L348 CegarLoopForPetriNet]: 92 programPoint places, 41 predicate places. [2021-08-13 15:23:09,531 INFO L482 AbstractCegarLoop]: Abstraction has has 133 places, 138 transitions, 692 flow [2021-08-13 15:23:09,531 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 77.14285714285714) internal successors, (540), 7 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 15:23:09,531 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:23:09,531 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:23:09,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 15:23:09,531 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:23:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:23:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash -720495291, now seen corresponding path program 1 times [2021-08-13 15:23:09,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:23:09,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376218196] [2021-08-13 15:23:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:23:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:23:09,556 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:23:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:23:09,584 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:23:09,604 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 15:23:09,605 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 15:23:09,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 15:23:09,607 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 15:23:09,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 03:23:09 BasicIcfg [2021-08-13 15:23:09,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 15:23:09,667 INFO L168 Benchmark]: Toolchain (without parser) took 6192.47 ms. Allocated memory was 181.4 MB in the beginning and 372.2 MB in the end (delta: 190.8 MB). Free memory was 144.8 MB in the beginning and 216.9 MB in the end (delta: -72.1 MB). Peak memory consumption was 119.8 MB. Max. memory is 8.0 GB. [2021-08-13 15:23:09,668 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 181.4 MB. Free memory is still 162.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 15:23:09,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.86 ms. Allocated memory is still 181.4 MB. Free memory was 144.6 MB in the beginning and 142.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 6.6 MB. Max. memory is 8.0 GB. [2021-08-13 15:23:09,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.08 ms. Allocated memory is still 181.4 MB. Free memory was 142.2 MB in the beginning and 139.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:23:09,669 INFO L168 Benchmark]: Boogie Preprocessor took 44.42 ms. Allocated memory is still 181.4 MB. Free memory was 139.2 MB in the beginning and 137.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-13 15:23:09,669 INFO L168 Benchmark]: RCFGBuilder took 1504.01 ms. Allocated memory was 181.4 MB in the beginning and 237.0 MB in the end (delta: 55.6 MB). Free memory was 137.1 MB in the beginning and 181.9 MB in the end (delta: -44.8 MB). Peak memory consumption was 68.9 MB. Max. memory is 8.0 GB. [2021-08-13 15:23:09,669 INFO L168 Benchmark]: TraceAbstraction took 4111.93 ms. Allocated memory was 237.0 MB in the beginning and 372.2 MB in the end (delta: 135.3 MB). Free memory was 181.4 MB in the beginning and 216.9 MB in the end (delta: -35.5 MB). Peak memory consumption was 99.8 MB. Max. memory is 8.0 GB. [2021-08-13 15:23:09,671 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 181.4 MB. Free memory is still 162.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 469.86 ms. Allocated memory is still 181.4 MB. Free memory was 144.6 MB in the beginning and 142.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 6.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 57.08 ms. Allocated memory is still 181.4 MB. Free memory was 142.2 MB in the beginning and 139.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.42 ms. Allocated memory is still 181.4 MB. Free memory was 139.2 MB in the beginning and 137.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1504.01 ms. Allocated memory was 181.4 MB in the beginning and 237.0 MB in the end (delta: 55.6 MB). Free memory was 137.1 MB in the beginning and 181.9 MB in the end (delta: -44.8 MB). Peak memory consumption was 68.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4111.93 ms. Allocated memory was 237.0 MB in the beginning and 372.2 MB in the end (delta: 135.3 MB). Free memory was 181.4 MB in the beginning and 216.9 MB in the end (delta: -35.5 MB). Peak memory consumption was 99.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 0 pthread_t t1591; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1592; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L803] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3983.6ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2573.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 33.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 76 SDtfs, 246 SDslu, 219 SDs, 0 SdLazy, 347 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 297.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 808.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4382occurred in iteration=5, InterpolantAutomatonStates: 77, 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: 39.9ms SsaConstructionTime, 346.6ms SatisfiabilityAnalysisTime, 803.2ms InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 1809 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...