/usr/bin/java -Xmx16000000000 -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-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:11:34,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:11:34,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:11:34,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:11:34,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:11:34,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:11:34,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:11:34,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:11:34,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:11:34,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:11:34,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:11:34,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:11:34,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:11:34,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:11:34,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:11:34,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:11:34,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:11:34,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:11:34,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:11:34,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:11:34,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:11:34,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:11:34,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:11:34,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:11:34,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:11:34,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:11:34,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:11:34,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:11:34,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:11:34,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:11:34,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:11:34,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:11:34,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:11:34,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:11:34,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:11:34,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:11:34,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:11:34,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:11:34,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:11:34,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:11:34,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:11:34,690 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-FA-NoLbe-Separate.epf [2021-06-05 10:11:34,715 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:11:34,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:11:34,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:11:34,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:11:34,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:11:34,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:11:34,724 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:11:34,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:11:34,724 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:11:34,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:11:34,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:11:34,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:11:34,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:11:34,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:11:34,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:11:34,726 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:11:34,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:11:34,726 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:11:34,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:11:34,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:11:34,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:11:34,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:11:34,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:11:34,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:11:34,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:11:34,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:11:34,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:11:34,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:11:34,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:11:34,727 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:11:34,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:11:34,728 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:11:34,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 10:11:35,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:11:35,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:11:35,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:11:35,051 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:11:35,051 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:11:35,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-06-05 10:11:35,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f545785/44bd848af4e846069d4c5a09c850697e/FLAG207044f9e [2021-06-05 10:11:35,663 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:11:35,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2021-06-05 10:11:35,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f545785/44bd848af4e846069d4c5a09c850697e/FLAG207044f9e [2021-06-05 10:11:35,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f545785/44bd848af4e846069d4c5a09c850697e [2021-06-05 10:11:35,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:11:35,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:11:35,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:11:35,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:11:35,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:11:35,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:11:35" (1/1) ... [2021-06-05 10:11:35,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c59f02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:35, skipping insertion in model container [2021-06-05 10:11:35,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:11:35" (1/1) ... [2021-06-05 10:11:35,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:11:36,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:11:36,175 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/safe029_power.oepc.i[952,965] [2021-06-05 10:11:36,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:11:36,327 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:11:36,337 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/safe029_power.oepc.i[952,965] [2021-06-05 10:11:36,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:11:36,433 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:11:36,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36 WrapperNode [2021-06-05 10:11:36,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:11:36,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:11:36,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:11:36,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:11:36,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:11:36,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:11:36,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:11:36,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:11:36,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (1/1) ... [2021-06-05 10:11:36,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:11:36,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:11:36,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:11:36,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:11:36,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (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-06-05 10:11:36,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:11:36,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:11:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:11:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:11:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 10:11:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 10:11:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 10:11:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 10:11:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:11:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:11:36,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:11:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:11:36,603 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 10:11:38,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:11:38,550 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 10:11:38,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:11:38 BoogieIcfgContainer [2021-06-05 10:11:38,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:11:38,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:11:38,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:11:38,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:11:38,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:11:35" (1/3) ... [2021-06-05 10:11:38,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a1498f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:11:38, skipping insertion in model container [2021-06-05 10:11:38,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:11:36" (2/3) ... [2021-06-05 10:11:38,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a1498f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:11:38, skipping insertion in model container [2021-06-05 10:11:38,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:11:38" (3/3) ... [2021-06-05 10:11:38,559 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2021-06-05 10:11:38,565 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:11:38,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:11:38,566 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 10:11:38,567 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:11:38,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,603 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,613 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,613 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,613 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:11:38,615 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 10:11:38,635 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 10:11:38,657 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:11:38,657 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:11:38,657 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:11:38,657 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:11:38,658 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:11:38,658 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:11:38,658 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:11:38,658 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:11:38,670 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-06-05 10:11:38,748 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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-06-05 10:11:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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-06-05 10:11:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 10:11:38,760 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:38,761 INFO L521 BasicCegarLoop]: 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] [2021-06-05 10:11:38,761 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash 182407281, now seen corresponding path program 1 times [2021-06-05 10:11:38,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:38,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511866119] [2021-06-05 10:11:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:39,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:39,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511866119] [2021-06-05 10:11:39,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511866119] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:39,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:39,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:11:39,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881436313] [2021-06-05 10:11:39,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:11:39,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:11:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:11:39,053 INFO L87 Difference]: Start difference. First operand has 1898 states, 1894 states have (on average 2.746040126715945) internal successors, (5201), 1897 states have internal predecessors, (5201), 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) Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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-06-05 10:11:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:39,145 INFO L93 Difference]: Finished difference Result 1627 states and 4300 transitions. [2021-06-05 10:11:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:11:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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) Word has length 37 [2021-06-05 10:11:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:39,168 INFO L225 Difference]: With dead ends: 1627 [2021-06-05 10:11:39,169 INFO L226 Difference]: Without dead ends: 1051 [2021-06-05 10:11:39,170 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:11:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2021-06-05 10:11:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2021-06-05 10:11:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 2.5866666666666664) internal successors, (2716), 1050 states have internal predecessors, (2716), 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-06-05 10:11:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 2716 transitions. [2021-06-05 10:11:39,266 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 2716 transitions. Word has length 37 [2021-06-05 10:11:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:39,266 INFO L482 AbstractCegarLoop]: Abstraction has 1051 states and 2716 transitions. [2021-06-05 10:11:39,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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-06-05 10:11:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 2716 transitions. [2021-06-05 10:11:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-06-05 10:11:39,272 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:39,272 INFO L521 BasicCegarLoop]: 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] [2021-06-05 10:11:39,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:11:39,272 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times [2021-06-05 10:11:39,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:39,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476579071] [2021-06-05 10:11:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:39,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:39,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476579071] [2021-06-05 10:11:39,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476579071] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:39,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:39,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:11:39,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754050997] [2021-06-05 10:11:39,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:11:39,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:11:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:11:39,527 INFO L87 Difference]: Start difference. First operand 1051 states and 2716 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-06-05 10:11:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:39,654 INFO L93 Difference]: Finished difference Result 1271 states and 3254 transitions. [2021-06-05 10:11:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:11:39,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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) Word has length 56 [2021-06-05 10:11:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:39,660 INFO L225 Difference]: With dead ends: 1271 [2021-06-05 10:11:39,660 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 10:11:39,661 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:11:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 10:11:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2021-06-05 10:11:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 2.5719921104536487) internal successors, (2608), 1014 states have internal predecessors, (2608), 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-06-05 10:11:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2608 transitions. [2021-06-05 10:11:39,687 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 2608 transitions. Word has length 56 [2021-06-05 10:11:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:39,688 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 2608 transitions. [2021-06-05 10:11:39,688 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-06-05 10:11:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 2608 transitions. [2021-06-05 10:11:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 10:11:39,692 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:39,692 INFO L521 BasicCegarLoop]: 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-06-05 10:11:39,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:11:39,693 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1550290026, now seen corresponding path program 1 times [2021-06-05 10:11:39,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:39,694 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059937450] [2021-06-05 10:11:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:39,979 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:39,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059937450] [2021-06-05 10:11:39,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059937450] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:39,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:39,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:11:39,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234292380] [2021-06-05 10:11:39,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:11:39,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:39,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:11:39,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:11:39,984 INFO L87 Difference]: Start difference. First operand 1015 states and 2608 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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-06-05 10:11:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:40,293 INFO L93 Difference]: Finished difference Result 1211 states and 3080 transitions. [2021-06-05 10:11:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:11:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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) Word has length 58 [2021-06-05 10:11:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:40,302 INFO L225 Difference]: With dead ends: 1211 [2021-06-05 10:11:40,303 INFO L226 Difference]: Without dead ends: 979 [2021-06-05 10:11:40,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 200.3ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:11:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-06-05 10:11:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2021-06-05 10:11:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 2.556237218813906) internal successors, (2500), 978 states have internal predecessors, (2500), 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-06-05 10:11:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2500 transitions. [2021-06-05 10:11:40,326 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 2500 transitions. Word has length 58 [2021-06-05 10:11:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:40,326 INFO L482 AbstractCegarLoop]: Abstraction has 979 states and 2500 transitions. [2021-06-05 10:11:40,327 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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-06-05 10:11:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 2500 transitions. [2021-06-05 10:11:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 10:11:40,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:40,329 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:40,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:11:40,329 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1756957986, now seen corresponding path program 1 times [2021-06-05 10:11:40,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:40,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176417780] [2021-06-05 10:11:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:40,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:40,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176417780] [2021-06-05 10:11:40,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176417780] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:40,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:40,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:11:40,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156298796] [2021-06-05 10:11:40,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:11:40,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:11:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:11:40,584 INFO L87 Difference]: Start difference. First operand 979 states and 2500 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-06-05 10:11:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:40,918 INFO L93 Difference]: Finished difference Result 1127 states and 2854 transitions. [2021-06-05 10:11:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:11:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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) Word has length 59 [2021-06-05 10:11:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:40,924 INFO L225 Difference]: With dead ends: 1127 [2021-06-05 10:11:40,924 INFO L226 Difference]: Without dead ends: 967 [2021-06-05 10:11:40,924 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 235.9ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:11:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-06-05 10:11:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2021-06-05 10:11:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.550724637681159) internal successors, (2464), 966 states have internal predecessors, (2464), 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-06-05 10:11:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2464 transitions. [2021-06-05 10:11:40,949 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2464 transitions. Word has length 59 [2021-06-05 10:11:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:40,949 INFO L482 AbstractCegarLoop]: Abstraction has 967 states and 2464 transitions. [2021-06-05 10:11:40,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-06-05 10:11:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2464 transitions. [2021-06-05 10:11:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 10:11:40,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:40,952 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:40,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:11:40,952 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:40,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:40,953 INFO L82 PathProgramCache]: Analyzing trace with hash 696872629, now seen corresponding path program 1 times [2021-06-05 10:11:40,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:40,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185343083] [2021-06-05 10:11:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:41,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:41,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185343083] [2021-06-05 10:11:41,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185343083] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:41,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:41,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:11:41,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722599746] [2021-06-05 10:11:41,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:11:41,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:11:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:11:41,291 INFO L87 Difference]: Start difference. First operand 967 states and 2464 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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-06-05 10:11:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:41,541 INFO L93 Difference]: Finished difference Result 1047 states and 2644 transitions. [2021-06-05 10:11:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:11:41,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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) Word has length 60 [2021-06-05 10:11:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:41,546 INFO L225 Difference]: With dead ends: 1047 [2021-06-05 10:11:41,546 INFO L226 Difference]: Without dead ends: 919 [2021-06-05 10:11:41,547 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 247.1ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:11:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-06-05 10:11:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2021-06-05 10:11:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 2.5403050108932463) internal successors, (2332), 918 states have internal predecessors, (2332), 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-06-05 10:11:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2332 transitions. [2021-06-05 10:11:41,570 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 2332 transitions. Word has length 60 [2021-06-05 10:11:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:41,570 INFO L482 AbstractCegarLoop]: Abstraction has 919 states and 2332 transitions. [2021-06-05 10:11:41,571 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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-06-05 10:11:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 2332 transitions. [2021-06-05 10:11:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 10:11:41,572 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:41,572 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:41,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:11:41,573 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1303999016, now seen corresponding path program 1 times [2021-06-05 10:11:41,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:41,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100656619] [2021-06-05 10:11:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:41,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:41,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100656619] [2021-06-05 10:11:41,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100656619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:41,697 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:41,697 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:11:41,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113383722] [2021-06-05 10:11:41,698 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:11:41,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:11:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:11:41,701 INFO L87 Difference]: Start difference. First operand 919 states and 2332 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-06-05 10:11:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:41,794 INFO L93 Difference]: Finished difference Result 1535 states and 3862 transitions. [2021-06-05 10:11:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:11:41,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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) Word has length 60 [2021-06-05 10:11:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:41,798 INFO L225 Difference]: With dead ends: 1535 [2021-06-05 10:11:41,799 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 10:11:41,799 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:11:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 10:11:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 871. [2021-06-05 10:11:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.466666666666667) internal successors, (2146), 870 states have internal predecessors, (2146), 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-06-05 10:11:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2146 transitions. [2021-06-05 10:11:41,819 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2146 transitions. Word has length 60 [2021-06-05 10:11:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:41,820 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 2146 transitions. [2021-06-05 10:11:41,820 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-06-05 10:11:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2146 transitions. [2021-06-05 10:11:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 10:11:41,822 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:41,822 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:41,822 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:11:41,822 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash -638334108, now seen corresponding path program 1 times [2021-06-05 10:11:41,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:41,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662365444] [2021-06-05 10:11:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:42,044 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:42,045 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662365444] [2021-06-05 10:11:42,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662365444] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:42,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:42,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 10:11:42,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003750319] [2021-06-05 10:11:42,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 10:11:42,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 10:11:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:11:42,050 INFO L87 Difference]: Start difference. First operand 871 states and 2146 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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-06-05 10:11:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:42,366 INFO L93 Difference]: Finished difference Result 1000 states and 2450 transitions. [2021-06-05 10:11:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:11:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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) Word has length 61 [2021-06-05 10:11:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:42,397 INFO L225 Difference]: With dead ends: 1000 [2021-06-05 10:11:42,397 INFO L226 Difference]: Without dead ends: 880 [2021-06-05 10:11:42,397 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 242.6ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:11:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-06-05 10:11:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2021-06-05 10:11:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 2.460750853242321) internal successors, (2163), 879 states have internal predecessors, (2163), 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-06-05 10:11:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2163 transitions. [2021-06-05 10:11:42,419 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2163 transitions. Word has length 61 [2021-06-05 10:11:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:42,419 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 2163 transitions. [2021-06-05 10:11:42,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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-06-05 10:11:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2163 transitions. [2021-06-05 10:11:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 10:11:42,421 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:42,421 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:42,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:11:42,421 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1801678580, now seen corresponding path program 2 times [2021-06-05 10:11:42,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:42,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242396058] [2021-06-05 10:11:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:42,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:42,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242396058] [2021-06-05 10:11:42,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242396058] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:42,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:42,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 10:11:42,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451225946] [2021-06-05 10:11:42,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 10:11:42,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 10:11:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:11:42,607 INFO L87 Difference]: Start difference. First operand 880 states and 2163 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-06-05 10:11:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:42,784 INFO L93 Difference]: Finished difference Result 1062 states and 2615 transitions. [2021-06-05 10:11:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:11:42,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) Word has length 61 [2021-06-05 10:11:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:42,789 INFO L225 Difference]: With dead ends: 1062 [2021-06-05 10:11:42,789 INFO L226 Difference]: Without dead ends: 942 [2021-06-05 10:11:42,789 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 132.9ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:11:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2021-06-05 10:11:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 885. [2021-06-05 10:11:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.4570135746606336) internal successors, (2172), 884 states have internal predecessors, (2172), 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-06-05 10:11:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2172 transitions. [2021-06-05 10:11:42,810 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 2172 transitions. Word has length 61 [2021-06-05 10:11:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:42,810 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 2172 transitions. [2021-06-05 10:11:42,810 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-06-05 10:11:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 2172 transitions. [2021-06-05 10:11:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 10:11:42,812 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:42,812 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:42,812 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:11:42,812 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2087995442, now seen corresponding path program 3 times [2021-06-05 10:11:42,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:42,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176983500] [2021-06-05 10:11:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:42,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:42,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176983500] [2021-06-05 10:11:42,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176983500] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:42,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:42,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 10:11:42,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113698736] [2021-06-05 10:11:42,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 10:11:42,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:42,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 10:11:42,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:11:42,933 INFO L87 Difference]: Start difference. First operand 885 states and 2172 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-06-05 10:11:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:43,125 INFO L93 Difference]: Finished difference Result 1069 states and 2625 transitions. [2021-06-05 10:11:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:11:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) Word has length 61 [2021-06-05 10:11:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:43,129 INFO L225 Difference]: With dead ends: 1069 [2021-06-05 10:11:43,129 INFO L226 Difference]: Without dead ends: 933 [2021-06-05 10:11:43,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 135.9ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:11:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2021-06-05 10:11:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 895. [2021-06-05 10:11:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 2.466442953020134) internal successors, (2205), 894 states have internal predecessors, (2205), 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-06-05 10:11:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2205 transitions. [2021-06-05 10:11:43,150 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2205 transitions. Word has length 61 [2021-06-05 10:11:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:43,150 INFO L482 AbstractCegarLoop]: Abstraction has 895 states and 2205 transitions. [2021-06-05 10:11:43,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-06-05 10:11:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2205 transitions. [2021-06-05 10:11:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 10:11:43,151 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:43,152 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:43,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:11:43,152 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1473113033, now seen corresponding path program 1 times [2021-06-05 10:11:43,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:43,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137433020] [2021-06-05 10:11:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:43,387 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:43,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137433020] [2021-06-05 10:11:43,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137433020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:43,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:43,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 10:11:43,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607141396] [2021-06-05 10:11:43,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 10:11:43,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 10:11:43,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:11:43,388 INFO L87 Difference]: Start difference. First operand 895 states and 2205 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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-06-05 10:11:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:43,801 INFO L93 Difference]: Finished difference Result 1036 states and 2509 transitions. [2021-06-05 10:11:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:11:43,802 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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) Word has length 62 [2021-06-05 10:11:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:43,805 INFO L225 Difference]: With dead ends: 1036 [2021-06-05 10:11:43,805 INFO L226 Difference]: Without dead ends: 805 [2021-06-05 10:11:43,806 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 410.0ms TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:11:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-06-05 10:11:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2021-06-05 10:11:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.4191542288557213) internal successors, (1945), 804 states have internal predecessors, (1945), 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-06-05 10:11:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1945 transitions. [2021-06-05 10:11:43,824 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1945 transitions. Word has length 62 [2021-06-05 10:11:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:43,824 INFO L482 AbstractCegarLoop]: Abstraction has 805 states and 1945 transitions. [2021-06-05 10:11:43,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 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-06-05 10:11:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1945 transitions. [2021-06-05 10:11:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 10:11:43,825 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:43,826 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:43,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:11:43,826 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:43,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:43,826 INFO L82 PathProgramCache]: Analyzing trace with hash 695919513, now seen corresponding path program 2 times [2021-06-05 10:11:43,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:43,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277807246] [2021-06-05 10:11:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:44,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:44,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277807246] [2021-06-05 10:11:44,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277807246] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:44,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:44,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:11:44,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197164493] [2021-06-05 10:11:44,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:11:44,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:44,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:11:44,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:11:44,094 INFO L87 Difference]: Start difference. First operand 805 states and 1945 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-06-05 10:11:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:44,533 INFO L93 Difference]: Finished difference Result 1181 states and 2835 transitions. [2021-06-05 10:11:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:11:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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) Word has length 62 [2021-06-05 10:11:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:44,537 INFO L225 Difference]: With dead ends: 1181 [2021-06-05 10:11:44,537 INFO L226 Difference]: Without dead ends: 769 [2021-06-05 10:11:44,537 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 455.6ms TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:11:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2021-06-05 10:11:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 649. [2021-06-05 10:11:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 2.3580246913580245) internal successors, (1528), 648 states have internal predecessors, (1528), 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-06-05 10:11:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1528 transitions. [2021-06-05 10:11:44,552 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1528 transitions. Word has length 62 [2021-06-05 10:11:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:44,552 INFO L482 AbstractCegarLoop]: Abstraction has 649 states and 1528 transitions. [2021-06-05 10:11:44,552 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-06-05 10:11:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1528 transitions. [2021-06-05 10:11:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 10:11:44,554 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:44,554 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:11:44,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 10:11:44,554 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash -80791419, now seen corresponding path program 1 times [2021-06-05 10:11:44,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:44,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138263370] [2021-06-05 10:11:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:44,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:44,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138263370] [2021-06-05 10:11:44,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138263370] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:44,633 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:44,633 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:11:44,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762732157] [2021-06-05 10:11:44,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:11:44,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:44,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:11:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:11:44,634 INFO L87 Difference]: Start difference. First operand 649 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-06-05 10:11:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:44,718 INFO L93 Difference]: Finished difference Result 719 states and 1652 transitions. [2021-06-05 10:11:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:11:44,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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) Word has length 62 [2021-06-05 10:11:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:44,721 INFO L225 Difference]: With dead ends: 719 [2021-06-05 10:11:44,721 INFO L226 Difference]: Without dead ends: 535 [2021-06-05 10:11:44,721 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:11:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-06-05 10:11:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2021-06-05 10:11:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.2659176029962547) internal successors, (1210), 534 states have internal predecessors, (1210), 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-06-05 10:11:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1210 transitions. [2021-06-05 10:11:44,731 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1210 transitions. Word has length 62 [2021-06-05 10:11:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:44,731 INFO L482 AbstractCegarLoop]: Abstraction has 535 states and 1210 transitions. [2021-06-05 10:11:44,732 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-06-05 10:11:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1210 transitions. [2021-06-05 10:11:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 10:11:44,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:44,733 INFO L521 BasicCegarLoop]: 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-06-05 10:11:44,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 10:11:44,733 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash -615861270, now seen corresponding path program 1 times [2021-06-05 10:11:44,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:44,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692008640] [2021-06-05 10:11:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:11:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:11:44,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:11:44,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692008640] [2021-06-05 10:11:44,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692008640] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:11:44,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:11:44,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:11:44,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813016740] [2021-06-05 10:11:44,830 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:11:44,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:11:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:11:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:11:44,831 INFO L87 Difference]: Start difference. First operand 535 states and 1210 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-06-05 10:11:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:11:44,932 INFO L93 Difference]: Finished difference Result 457 states and 987 transitions. [2021-06-05 10:11:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:11:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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) Word has length 63 [2021-06-05 10:11:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:11:44,934 INFO L225 Difference]: With dead ends: 457 [2021-06-05 10:11:44,934 INFO L226 Difference]: Without dead ends: 273 [2021-06-05 10:11:44,934 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 113.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:11:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-06-05 10:11:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-06-05 10:11:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.0588235294117645) internal successors, (560), 272 states have internal predecessors, (560), 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-06-05 10:11:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 560 transitions. [2021-06-05 10:11:44,939 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 560 transitions. Word has length 63 [2021-06-05 10:11:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:11:44,940 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 560 transitions. [2021-06-05 10:11:44,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-06-05 10:11:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 560 transitions. [2021-06-05 10:11:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 10:11:44,940 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:11:44,940 INFO L521 BasicCegarLoop]: 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-06-05 10:11:44,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 10:11:44,941 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:11:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:11:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1463907637, now seen corresponding path program 1 times [2021-06-05 10:11:44,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:11:44,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215940347] [2021-06-05 10:11:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:11:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:11:44,968 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:11:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:11:44,999 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:11:45,027 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:11:45,027 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:11:45,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 10:11:45,030 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:11:45,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:11:45 BasicIcfg [2021-06-05 10:11:45,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:11:45,113 INFO L168 Benchmark]: Toolchain (without parser) took 9130.00 ms. Allocated memory was 312.5 MB in the beginning and 434.1 MB in the end (delta: 121.6 MB). Free memory was 274.4 MB in the beginning and 336.8 MB in the end (delta: -62.4 MB). Peak memory consumption was 61.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:11:45,113 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 312.5 MB. Free memory is still 292.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:11:45,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.59 ms. Allocated memory is still 312.5 MB. Free memory was 274.2 MB in the beginning and 272.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-06-05 10:11:45,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.55 ms. Allocated memory is still 312.5 MB. Free memory was 272.2 MB in the beginning and 269.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:11:45,117 INFO L168 Benchmark]: Boogie Preprocessor took 26.18 ms. Allocated memory is still 312.5 MB. Free memory was 269.1 MB in the beginning and 267.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:11:45,117 INFO L168 Benchmark]: RCFGBuilder took 2046.04 ms. Allocated memory is still 312.5 MB. Free memory was 267.0 MB in the beginning and 230.9 MB in the end (delta: 36.1 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:11:45,118 INFO L168 Benchmark]: TraceAbstraction took 6558.38 ms. Allocated memory was 312.5 MB in the beginning and 434.1 MB in the end (delta: 121.6 MB). Free memory was 230.9 MB in the beginning and 336.8 MB in the end (delta: -105.9 MB). Peak memory consumption was 16.7 MB. Max. memory is 16.0 GB. [2021-06-05 10:11:45,122 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.16 ms. Allocated memory is still 312.5 MB. Free memory is still 292.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 448.59 ms. Allocated memory is still 312.5 MB. Free memory was 274.2 MB in the beginning and 272.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.55 ms. Allocated memory is still 312.5 MB. Free memory was 272.2 MB in the beginning and 269.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.18 ms. Allocated memory is still 312.5 MB. Free memory was 269.1 MB in the beginning and 267.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2046.04 ms. Allocated memory is still 312.5 MB. Free memory was 267.0 MB in the beginning and 230.9 MB in the end (delta: 36.1 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6558.38 ms. Allocated memory was 312.5 MB in the beginning and 434.1 MB in the end (delta: 121.6 MB). Free memory was 230.9 MB in the beginning and 336.8 MB in the end (delta: -105.9 MB). Peak memory consumption was 16.7 MB. Max. memory is 16.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] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6373.1ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 36.2ms, AutomataDifference: 3071.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 90.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1326 SDtfs, 2428 SDslu, 5282 SDs, 0 SdLazy, 946 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 992.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2443.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1898occurred in iteration=0, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 309.9ms AutomataMinimizationTime, 13 MinimizatonAttempts, 365 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 83.6ms SsaConstructionTime, 492.9ms SatisfiabilityAnalysisTime, 2013.5ms InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 4469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...