/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 19:53:41,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 19:53:41,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 19:53:41,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 19:53:41,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 19:53:41,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 19:53:41,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 19:53:41,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 19:53:41,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 19:53:41,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 19:53:41,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 19:53:41,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 19:53:41,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 19:53:41,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 19:53:41,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 19:53:41,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 19:53:41,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 19:53:41,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 19:53:41,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 19:53:41,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 19:53:41,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 19:53:41,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 19:53:41,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 19:53:41,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 19:53:41,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 19:53:41,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 19:53:41,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 19:53:41,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 19:53:41,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 19:53:41,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 19:53:41,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 19:53:41,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 19:53:41,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 19:53:41,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 19:53:41,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 19:53:41,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 19:53:41,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 19:53:41,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 19:53:41,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 19:53:41,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 19:53:41,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 19:53:41,871 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.epf [2021-06-05 19:53:41,907 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 19:53:41,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 19:53:41,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 19:53:41,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 19:53:41,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 19:53:41,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 19:53:41,911 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 19:53:41,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 19:53:41,911 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 19:53:41,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 19:53:41,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 19:53:41,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 19:53:41,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 19:53:41,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 19:53:41,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 19:53:41,913 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 19:53:41,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 19:53:41,913 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 19:53:41,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 19:53:41,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 19:53:41,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 19:53:41,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 19:53:41,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 19:53:41,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 19:53:41,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 19:53:41,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 19:53:41,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 19:53:41,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 19:53:41,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 19:53:41,914 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 19:53:41,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 19:53:41,915 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 19:53:42,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 19:53:42,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 19:53:42,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 19:53:42,261 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 19:53:42,261 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 19:53:42,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-06-05 19:53:42,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e883080/e3dea948b53f430fa71648b38af804ec/FLAGf3cbe4dc2 [2021-06-05 19:53:42,933 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 19:53:42,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-06-05 19:53:42,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e883080/e3dea948b53f430fa71648b38af804ec/FLAGf3cbe4dc2 [2021-06-05 19:53:43,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e883080/e3dea948b53f430fa71648b38af804ec [2021-06-05 19:53:43,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 19:53:43,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 19:53:43,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 19:53:43,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 19:53:43,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 19:53:43,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:43,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e675af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43, skipping insertion in model container [2021-06-05 19:53:43,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:43,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 19:53:43,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 19:53:43,550 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/safe017_power.oepc.i[952,965] [2021-06-05 19:53:43,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:53:43,772 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 19:53:43,785 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/safe017_power.oepc.i[952,965] [2021-06-05 19:53:43,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 19:53:43,929 INFO L208 MainTranslator]: Completed translation [2021-06-05 19:53:43,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43 WrapperNode [2021-06-05 19:53:43,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 19:53:43,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 19:53:43,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 19:53:43,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 19:53:43,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:43,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 19:53:44,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 19:53:44,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 19:53:44,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 19:53:44,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (1/1) ... [2021-06-05 19:53:44,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 19:53:44,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 19:53:44,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 19:53:44,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 19:53:44,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (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 19:53:44,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 19:53:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 19:53:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 19:53:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 19:53:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 19:53:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 19:53:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 19:53:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 19:53:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 19:53:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 19:53:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 19:53:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 19:53:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 19:53:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 19:53:44,161 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 19:53:46,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 19:53:46,024 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 19:53:46,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:53:46 BoogieIcfgContainer [2021-06-05 19:53:46,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 19:53:46,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 19:53:46,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 19:53:46,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 19:53:46,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:53:43" (1/3) ... [2021-06-05 19:53:46,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919a657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:53:46, skipping insertion in model container [2021-06-05 19:53:46,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:53:43" (2/3) ... [2021-06-05 19:53:46,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919a657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:53:46, skipping insertion in model container [2021-06-05 19:53:46,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:53:46" (3/3) ... [2021-06-05 19:53:46,032 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2021-06-05 19:53:46,038 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 19:53:46,038 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 19:53:46,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 19:53:46,039 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 19:53:46,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,067 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,068 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,068 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,068 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,068 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,068 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,068 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,068 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,069 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,069 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,069 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,081 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,081 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,084 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 19:53:46,090 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 19:53:46,108 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:53:46,123 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:53:46,124 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:53:46,124 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:53:46,124 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:53:46,124 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:53:46,124 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:53:46,124 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:53:46,124 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0======== [2021-06-05 19:53:46,133 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-06-05 19:53:47,031 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 19:53:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 19:53:47,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:53:47,135 INFO L301 ceAbstractionStarter]: Result for error location P0 was SAFE (1/3) [2021-06-05 19:53:47,137 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 19:53:47,139 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:53:47,139 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:53:47,140 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:53:47,140 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:53:47,140 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:53:47,140 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:53:47,140 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:53:47,140 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 19:53:47,143 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-06-05 19:53:47,678 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 19:53:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 19:53:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 19:53:47,735 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:47,736 INFO L554 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 19:53:47,736 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -247046329, now seen corresponding path program 1 times [2021-06-05 19:53:47,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:47,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059429377] [2021-06-05 19:53:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:48,268 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 19:53:48,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:48,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059429377] [2021-06-05 19:53:48,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059429377] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:48,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:48,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:53:48,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365505506] [2021-06-05 19:53:48,273 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:53:48,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:53:48,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:53:48,309 INFO L87 Difference]: Start difference. First operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 19:53:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:48,680 INFO L93 Difference]: Finished difference Result 18686 states and 65934 transitions. [2021-06-05 19:53:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:53:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66 [2021-06-05 19:53:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:48,758 INFO L225 Difference]: With dead ends: 18686 [2021-06-05 19:53:48,758 INFO L226 Difference]: Without dead ends: 7346 [2021-06-05 19:53:48,760 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 102.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:53:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2021-06-05 19:53:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 7346. [2021-06-05 19:53:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7346 states, 7344 states have (on average 3.4595588235294117) internal successors, (25407), 7345 states have internal predecessors, (25407), 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 19:53:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 25407 transitions. [2021-06-05 19:53:49,124 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 25407 transitions. Word has length 66 [2021-06-05 19:53:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:49,126 INFO L482 AbstractCegarLoop]: Abstraction has 7346 states and 25407 transitions. [2021-06-05 19:53:49,126 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 19:53:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 25407 transitions. [2021-06-05 19:53:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 19:53:49,143 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:49,143 INFO L554 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, 1, 1] [2021-06-05 19:53:49,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 19:53:49,144 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 919859046, now seen corresponding path program 1 times [2021-06-05 19:53:49,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:49,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367460150] [2021-06-05 19:53:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:49,376 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 19:53:49,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:49,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367460150] [2021-06-05 19:53:49,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367460150] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:49,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:49,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:53:49,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095871584] [2021-06-05 19:53:49,381 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:53:49,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:49,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:53:49,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:53:49,382 INFO L87 Difference]: Start difference. First operand 7346 states and 25407 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 19:53:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:49,571 INFO L93 Difference]: Finished difference Result 8570 states and 29385 transitions. [2021-06-05 19:53:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:53:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 68 [2021-06-05 19:53:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:49,694 INFO L225 Difference]: With dead ends: 8570 [2021-06-05 19:53:49,694 INFO L226 Difference]: Without dead ends: 7058 [2021-06-05 19:53:49,695 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 103.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:53:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2021-06-05 19:53:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 7058. [2021-06-05 19:53:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7058 states, 7056 states have (on average 3.444302721088435) internal successors, (24303), 7057 states have internal predecessors, (24303), 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 19:53:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7058 states to 7058 states and 24303 transitions. [2021-06-05 19:53:49,915 INFO L78 Accepts]: Start accepts. Automaton has 7058 states and 24303 transitions. Word has length 68 [2021-06-05 19:53:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:49,915 INFO L482 AbstractCegarLoop]: Abstraction has 7058 states and 24303 transitions. [2021-06-05 19:53:49,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 19:53:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 7058 states and 24303 transitions. [2021-06-05 19:53:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 19:53:49,928 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:49,928 INFO L554 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, 1, 1, 1, 1] [2021-06-05 19:53:49,928 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 19:53:49,928 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1609684155, now seen corresponding path program 1 times [2021-06-05 19:53:49,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:49,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157159088] [2021-06-05 19:53:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:50,217 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 19:53:50,218 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:50,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157159088] [2021-06-05 19:53:50,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157159088] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:50,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:50,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 19:53:50,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251436250] [2021-06-05 19:53:50,219 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 19:53:50,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:50,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 19:53:50,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 19:53:50,221 INFO L87 Difference]: Start difference. First operand 7058 states and 24303 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 19:53:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:50,593 INFO L93 Difference]: Finished difference Result 8223 states and 28080 transitions. [2021-06-05 19:53:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 19:53:50,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2021-06-05 19:53:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:50,634 INFO L225 Difference]: With dead ends: 8223 [2021-06-05 19:53:50,634 INFO L226 Difference]: Without dead ends: 6907 [2021-06-05 19:53:50,635 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 224.9ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-05 19:53:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6907 states. [2021-06-05 19:53:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6907 to 6907. [2021-06-05 19:53:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6907 states, 6905 states have (on average 3.438522809558291) internal successors, (23743), 6906 states have internal predecessors, (23743), 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 19:53:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 23743 transitions. [2021-06-05 19:53:50,888 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 23743 transitions. Word has length 70 [2021-06-05 19:53:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:50,889 INFO L482 AbstractCegarLoop]: Abstraction has 6907 states and 23743 transitions. [2021-06-05 19:53:50,889 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 19:53:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 23743 transitions. [2021-06-05 19:53:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 19:53:50,901 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:50,901 INFO L554 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, 1, 1, 1, 1, 1] [2021-06-05 19:53:50,902 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 19:53:50,902 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1884164749, now seen corresponding path program 1 times [2021-06-05 19:53:50,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:50,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220732128] [2021-06-05 19:53:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:51,173 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 19:53:51,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:51,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220732128] [2021-06-05 19:53:51,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220732128] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:51,174 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:51,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 19:53:51,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414656305] [2021-06-05 19:53:51,175 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 19:53:51,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:51,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 19:53:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:53:51,177 INFO L87 Difference]: Start difference. First operand 6907 states and 23743 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 19:53:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:51,522 INFO L93 Difference]: Finished difference Result 7819 states and 26687 transitions. [2021-06-05 19:53:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 19:53:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 71 [2021-06-05 19:53:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:51,547 INFO L225 Difference]: With dead ends: 7819 [2021-06-05 19:53:51,548 INFO L226 Difference]: Without dead ends: 6971 [2021-06-05 19:53:51,548 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 283.7ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-06-05 19:53:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6971 states. [2021-06-05 19:53:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6971 to 6971. [2021-06-05 19:53:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6971 states, 6969 states have (on average 3.4356435643564356) internal successors, (23943), 6970 states have internal predecessors, (23943), 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 19:53:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6971 states to 6971 states and 23943 transitions. [2021-06-05 19:53:51,795 INFO L78 Accepts]: Start accepts. Automaton has 6971 states and 23943 transitions. Word has length 71 [2021-06-05 19:53:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:51,795 INFO L482 AbstractCegarLoop]: Abstraction has 6971 states and 23943 transitions. [2021-06-05 19:53:51,795 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 19:53:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6971 states and 23943 transitions. [2021-06-05 19:53:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 19:53:51,808 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:51,808 INFO L554 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, 1, 1, 1, 1, 1] [2021-06-05 19:53:51,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 19:53:51,808 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1246831739, now seen corresponding path program 1 times [2021-06-05 19:53:51,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:51,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338471828] [2021-06-05 19:53:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:51,959 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 19:53:51,960 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:51,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338471828] [2021-06-05 19:53:51,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338471828] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:51,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:51,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:53:51,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655295439] [2021-06-05 19:53:51,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:53:51,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:53:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:53:51,962 INFO L87 Difference]: Start difference. First operand 6971 states and 23943 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 19:53:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:52,278 INFO L93 Difference]: Finished difference Result 7649 states and 26007 transitions. [2021-06-05 19:53:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 19:53:52,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 71 [2021-06-05 19:53:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:52,300 INFO L225 Difference]: With dead ends: 7649 [2021-06-05 19:53:52,301 INFO L226 Difference]: Without dead ends: 6749 [2021-06-05 19:53:52,301 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 147.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:53:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6749 states. [2021-06-05 19:53:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6749 to 6671. [2021-06-05 19:53:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6671 states, 6669 states have (on average 3.405757984705353) internal successors, (22713), 6670 states have internal predecessors, (22713), 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 19:53:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 22713 transitions. [2021-06-05 19:53:52,567 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 22713 transitions. Word has length 71 [2021-06-05 19:53:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:52,567 INFO L482 AbstractCegarLoop]: Abstraction has 6671 states and 22713 transitions. [2021-06-05 19:53:52,567 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 19:53:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 22713 transitions. [2021-06-05 19:53:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 19:53:52,580 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:52,580 INFO L554 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, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:52,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 19:53:52,580 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash 585966601, now seen corresponding path program 1 times [2021-06-05 19:53:52,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:52,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415537485] [2021-06-05 19:53:52,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:52,684 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 19:53:52,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:52,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415537485] [2021-06-05 19:53:52,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415537485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:52,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:52,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:53:52,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922287513] [2021-06-05 19:53:52,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:53:52,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:53:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:53:52,686 INFO L87 Difference]: Start difference. First operand 6671 states and 22713 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 19:53:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:52,970 INFO L93 Difference]: Finished difference Result 15276 states and 51448 transitions. [2021-06-05 19:53:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 19:53:52,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2021-06-05 19:53:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:52,990 INFO L225 Difference]: With dead ends: 15276 [2021-06-05 19:53:52,990 INFO L226 Difference]: Without dead ends: 7057 [2021-06-05 19:53:52,990 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 190.1ms TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-06-05 19:53:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7057 states. [2021-06-05 19:53:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7057 to 6187. [2021-06-05 19:53:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6187 states, 6185 states have (on average 3.2921584478577204) internal successors, (20362), 6186 states have internal predecessors, (20362), 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 19:53:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 20362 transitions. [2021-06-05 19:53:53,313 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 20362 transitions. Word has length 72 [2021-06-05 19:53:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:53,313 INFO L482 AbstractCegarLoop]: Abstraction has 6187 states and 20362 transitions. [2021-06-05 19:53:53,313 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 19:53:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 20362 transitions. [2021-06-05 19:53:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 19:53:53,325 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:53,326 INFO L554 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:53,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 19:53:53,326 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -976081717, now seen corresponding path program 1 times [2021-06-05 19:53:53,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:53,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115179237] [2021-06-05 19:53:53,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:53,609 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 19:53:53,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:53,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115179237] [2021-06-05 19:53:53,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115179237] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:53,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:53,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 19:53:53,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135316161] [2021-06-05 19:53:53,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 19:53:53,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:53,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 19:53:53,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:53:53,611 INFO L87 Difference]: Start difference. First operand 6187 states and 20362 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 19:53:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:53,883 INFO L93 Difference]: Finished difference Result 6715 states and 22014 transitions. [2021-06-05 19:53:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 19:53:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 73 [2021-06-05 19:53:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:53,898 INFO L225 Difference]: With dead ends: 6715 [2021-06-05 19:53:53,898 INFO L226 Difference]: Without dead ends: 6139 [2021-06-05 19:53:53,898 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 238.3ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-06-05 19:53:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2021-06-05 19:53:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 6003. [2021-06-05 19:53:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6003 states, 6001 states have (on average 3.3074487585402434) internal successors, (19848), 6002 states have internal predecessors, (19848), 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 19:53:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 19848 transitions. [2021-06-05 19:53:54,045 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 19848 transitions. Word has length 73 [2021-06-05 19:53:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:54,045 INFO L482 AbstractCegarLoop]: Abstraction has 6003 states and 19848 transitions. [2021-06-05 19:53:54,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 19:53:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 19848 transitions. [2021-06-05 19:53:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 19:53:54,057 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:54,057 INFO L554 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:54,057 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 19:53:54,057 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1613414727, now seen corresponding path program 1 times [2021-06-05 19:53:54,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:54,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131688115] [2021-06-05 19:53:54,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:54,330 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 19:53:54,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:54,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131688115] [2021-06-05 19:53:54,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131688115] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:54,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:54,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 19:53:54,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141952209] [2021-06-05 19:53:54,331 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 19:53:54,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:54,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 19:53:54,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 19:53:54,331 INFO L87 Difference]: Start difference. First operand 6003 states and 19848 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 19:53:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:54,670 INFO L93 Difference]: Finished difference Result 7202 states and 23768 transitions. [2021-06-05 19:53:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 19:53:54,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 73 [2021-06-05 19:53:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:54,684 INFO L225 Difference]: With dead ends: 7202 [2021-06-05 19:53:54,684 INFO L226 Difference]: Without dead ends: 5898 [2021-06-05 19:53:54,684 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 193.0ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-06-05 19:53:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2021-06-05 19:53:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 5778. [2021-06-05 19:53:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 5777 states have (on average 3.294097282326467) internal successors, (19030), 5777 states have internal predecessors, (19030), 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 19:53:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 19030 transitions. [2021-06-05 19:53:54,814 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 19030 transitions. Word has length 73 [2021-06-05 19:53:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:54,815 INFO L482 AbstractCegarLoop]: Abstraction has 5778 states and 19030 transitions. [2021-06-05 19:53:54,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 19:53:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 19030 transitions. [2021-06-05 19:53:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 19:53:54,826 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:54,826 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:54,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 19:53:54,827 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -357776600, now seen corresponding path program 1 times [2021-06-05 19:53:54,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:54,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962473553] [2021-06-05 19:53:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:54,943 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 19:53:54,944 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:54,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962473553] [2021-06-05 19:53:54,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962473553] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:54,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:54,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 19:53:54,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226798811] [2021-06-05 19:53:54,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 19:53:54,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:54,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 19:53:54,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 19:53:54,946 INFO L87 Difference]: Start difference. First operand 5778 states and 19030 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 19:53:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:55,073 INFO L93 Difference]: Finished difference Result 6950 states and 22460 transitions. [2021-06-05 19:53:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:53:55,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2021-06-05 19:53:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:55,084 INFO L225 Difference]: With dead ends: 6950 [2021-06-05 19:53:55,084 INFO L226 Difference]: Without dead ends: 5046 [2021-06-05 19:53:55,085 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:53:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2021-06-05 19:53:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 5046. [2021-06-05 19:53:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5046 states, 5045 states have (on average 3.2154608523290387) internal successors, (16222), 5045 states have internal predecessors, (16222), 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 19:53:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 16222 transitions. [2021-06-05 19:53:55,239 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 16222 transitions. Word has length 74 [2021-06-05 19:53:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:55,240 INFO L482 AbstractCegarLoop]: Abstraction has 5046 states and 16222 transitions. [2021-06-05 19:53:55,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 19:53:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 16222 transitions. [2021-06-05 19:53:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 19:53:55,249 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:55,249 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:55,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 19:53:55,250 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:55,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:55,250 INFO L82 PathProgramCache]: Analyzing trace with hash 906527511, now seen corresponding path program 1 times [2021-06-05 19:53:55,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:55,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981543228] [2021-06-05 19:53:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:55,390 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 19:53:55,391 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:55,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981543228] [2021-06-05 19:53:55,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981543228] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:55,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:55,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 19:53:55,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025432020] [2021-06-05 19:53:55,391 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 19:53:55,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:55,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 19:53:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 19:53:55,392 INFO L87 Difference]: Start difference. First operand 5046 states and 16222 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 19:53:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:55,520 INFO L93 Difference]: Finished difference Result 4836 states and 15134 transitions. [2021-06-05 19:53:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 19:53:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 75 [2021-06-05 19:53:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:55,526 INFO L225 Difference]: With dead ends: 4836 [2021-06-05 19:53:55,527 INFO L226 Difference]: Without dead ends: 3372 [2021-06-05 19:53:55,527 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 100.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 19:53:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2021-06-05 19:53:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3240. [2021-06-05 19:53:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 3239 states have (on average 3.0648348255634454) internal successors, (9927), 3239 states have internal predecessors, (9927), 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 19:53:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 9927 transitions. [2021-06-05 19:53:55,587 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 9927 transitions. Word has length 75 [2021-06-05 19:53:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:55,587 INFO L482 AbstractCegarLoop]: Abstraction has 3240 states and 9927 transitions. [2021-06-05 19:53:55,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 19:53:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 9927 transitions. [2021-06-05 19:53:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 19:53:55,593 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:55,593 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:55,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 19:53:55,593 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash -153865418, now seen corresponding path program 1 times [2021-06-05 19:53:55,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:55,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659447480] [2021-06-05 19:53:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:55,690 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 19:53:55,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:55,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659447480] [2021-06-05 19:53:55,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659447480] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:55,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:55,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 19:53:55,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608669088] [2021-06-05 19:53:55,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 19:53:55,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:55,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 19:53:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 19:53:55,691 INFO L87 Difference]: Start difference. First operand 3240 states and 9927 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 19:53:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:55,832 INFO L93 Difference]: Finished difference Result 2682 states and 8022 transitions. [2021-06-05 19:53:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 19:53:55,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 77 [2021-06-05 19:53:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:55,836 INFO L225 Difference]: With dead ends: 2682 [2021-06-05 19:53:55,836 INFO L226 Difference]: Without dead ends: 1737 [2021-06-05 19:53:55,836 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 115.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 19:53:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2021-06-05 19:53:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1689. [2021-06-05 19:53:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1688 states have (on average 2.941943127962085) internal successors, (4966), 1688 states have internal predecessors, (4966), 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 19:53:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 4966 transitions. [2021-06-05 19:53:55,862 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 4966 transitions. Word has length 77 [2021-06-05 19:53:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:55,863 INFO L482 AbstractCegarLoop]: Abstraction has 1689 states and 4966 transitions. [2021-06-05 19:53:55,863 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 19:53:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 4966 transitions. [2021-06-05 19:53:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 19:53:55,865 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:55,866 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:55,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 19:53:55,866 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 444856745, now seen corresponding path program 1 times [2021-06-05 19:53:55,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:55,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144826896] [2021-06-05 19:53:55,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:56,081 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 19:53:56,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:56,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144826896] [2021-06-05 19:53:56,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144826896] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:56,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:56,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 19:53:56,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946980044] [2021-06-05 19:53:56,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 19:53:56,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 19:53:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 19:53:56,083 INFO L87 Difference]: Start difference. First operand 1689 states and 4966 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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 19:53:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:56,228 INFO L93 Difference]: Finished difference Result 2514 states and 7505 transitions. [2021-06-05 19:53:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 19:53:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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 80 [2021-06-05 19:53:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:56,231 INFO L225 Difference]: With dead ends: 2514 [2021-06-05 19:53:56,231 INFO L226 Difference]: Without dead ends: 1748 [2021-06-05 19:53:56,232 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 156.9ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-06-05 19:53:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2021-06-05 19:53:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1433. [2021-06-05 19:53:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 2.8645251396648046) internal successors, (4102), 1432 states have internal predecessors, (4102), 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 19:53:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 4102 transitions. [2021-06-05 19:53:56,259 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 4102 transitions. Word has length 80 [2021-06-05 19:53:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:56,259 INFO L482 AbstractCegarLoop]: Abstraction has 1433 states and 4102 transitions. [2021-06-05 19:53:56,259 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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 19:53:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 4102 transitions. [2021-06-05 19:53:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 19:53:56,262 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:56,262 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:56,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 19:53:56,262 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2008605049, now seen corresponding path program 2 times [2021-06-05 19:53:56,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:56,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013559684] [2021-06-05 19:53:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:56,643 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 19:53:56,643 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:56,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013559684] [2021-06-05 19:53:56,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013559684] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:56,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:56,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 19:53:56,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043106271] [2021-06-05 19:53:56,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 19:53:56,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 19:53:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-06-05 19:53:56,645 INFO L87 Difference]: Start difference. First operand 1433 states and 4102 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 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 19:53:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:56,920 INFO L93 Difference]: Finished difference Result 2258 states and 6641 transitions. [2021-06-05 19:53:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 19:53:56,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 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 80 [2021-06-05 19:53:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:56,923 INFO L225 Difference]: With dead ends: 2258 [2021-06-05 19:53:56,923 INFO L226 Difference]: Without dead ends: 1348 [2021-06-05 19:53:56,923 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 369.6ms TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-06-05 19:53:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2021-06-05 19:53:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1213. [2021-06-05 19:53:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 2.876237623762376) internal successors, (3486), 1212 states have internal predecessors, (3486), 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 19:53:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 3486 transitions. [2021-06-05 19:53:56,941 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 3486 transitions. Word has length 80 [2021-06-05 19:53:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:56,942 INFO L482 AbstractCegarLoop]: Abstraction has 1213 states and 3486 transitions. [2021-06-05 19:53:56,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 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 19:53:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 3486 transitions. [2021-06-05 19:53:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 19:53:56,943 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:56,943 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 19:53:56,943 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 19:53:56,943 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2008656329, now seen corresponding path program 3 times [2021-06-05 19:53:56,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:56,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761215068] [2021-06-05 19:53:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:53:56,985 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:53:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 19:53:57,029 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 19:53:57,062 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 19:53:57,062 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 19:53:57,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 19:53:57,063 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-05 19:53:57,064 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 19:53:57,065 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 19:53:57,065 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 19:53:57,065 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 19:53:57,065 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 19:53:57,065 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 19:53:57,065 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 19:53:57,065 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 19:53:57,065 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P0Thread1of1ForFork2======== [2021-06-05 19:53:57,067 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow [2021-06-05 19:53:57,605 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 19:53:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 19:53:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 19:53:57,625 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 19:53:57,625 INFO L554 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] [2021-06-05 19:53:57,626 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 19:53:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 19:53:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash -857883359, now seen corresponding path program 1 times [2021-06-05 19:53:57,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 19:53:57,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63251724] [2021-06-05 19:53:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 19:53:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 19:53:57,645 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 19:53:57,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 19:53:57,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63251724] [2021-06-05 19:53:57,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63251724] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 19:53:57,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 19:53:57,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 19:53:57,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267091353] [2021-06-05 19:53:57,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 19:53:57,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 19:53:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 19:53:57,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:53:57,669 INFO L87 Difference]: Start difference. First operand has 14150 states, 14146 states have (on average 3.615651067439559) internal successors, (51147), 14149 states have internal predecessors, (51147), 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 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 19:53:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 19:53:57,775 INFO L93 Difference]: Finished difference Result 12134 states and 42782 transitions. [2021-06-05 19:53:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 19:53:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2021-06-05 19:53:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 19:53:57,776 INFO L225 Difference]: With dead ends: 12134 [2021-06-05 19:53:57,776 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 19:53:57,777 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 19:53:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 19:53:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 19:53:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 19:53:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 19:53:57,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2021-06-05 19:53:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 19:53:57,777 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 19:53:57,777 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 19:53:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 19:53:57,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 19:53:57,778 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 19:53:57,778 INFO L301 ceAbstractionStarter]: Result for error location P0Thread1of1ForFork2 was SAFE (3/3) [2021-06-05 19:53:57,778 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 19:53:57,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:53:57 BasicIcfg [2021-06-05 19:53:57,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 19:53:57,915 INFO L168 Benchmark]: Toolchain (without parser) took 14594.59 ms. Allocated memory was 346.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 308.2 MB in the beginning and 1.2 GB in the end (delta: -915.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.0 GB. [2021-06-05 19:53:57,916 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 346.0 MB. Free memory is still 326.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 19:53:57,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.54 ms. Allocated memory is still 346.0 MB. Free memory was 308.0 MB in the beginning and 304.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:53:57,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.89 ms. Allocated memory is still 346.0 MB. Free memory was 304.5 MB in the beginning and 301.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:53:57,916 INFO L168 Benchmark]: Boogie Preprocessor took 54.14 ms. Allocated memory is still 346.0 MB. Free memory was 301.4 MB in the beginning and 299.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 19:53:57,916 INFO L168 Benchmark]: RCFGBuilder took 1958.23 ms. Allocated memory is still 346.0 MB. Free memory was 299.3 MB in the beginning and 235.9 MB in the end (delta: 63.4 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. [2021-06-05 19:53:57,916 INFO L168 Benchmark]: TraceAbstraction took 11884.50 ms. Allocated memory was 346.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 235.9 MB in the beginning and 1.2 GB in the end (delta: -988.1 MB). Peak memory consumption was 972.7 MB. Max. memory is 16.0 GB. [2021-06-05 19:53:57,917 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.15 ms. Allocated memory is still 346.0 MB. Free memory is still 326.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 609.54 ms. Allocated memory is still 346.0 MB. Free memory was 308.0 MB in the beginning and 304.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 80.89 ms. Allocated memory is still 346.0 MB. Free memory was 304.5 MB in the beginning and 301.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 54.14 ms. Allocated memory is still 346.0 MB. Free memory was 301.4 MB in the beginning and 299.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1958.23 ms. Allocated memory is still 346.0 MB. Free memory was 299.3 MB in the beginning and 235.9 MB in the end (delta: 63.4 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11884.50 ms. Allocated memory was 346.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 235.9 MB in the beginning and 1.2 GB in the end (delta: -988.1 MB). Peak memory consumption was 972.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L788] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L754] 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) [L754] 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) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 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 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 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 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L824] 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) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 for errors in thread instance: P0 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1013.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 102.9ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 907.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14150occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9923.2ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 176.4ms, AutomataDifference: 3722.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 538.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1753 SDtfs, 3130 SDslu, 6869 SDs, 0 SdLazy, 972 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1050.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2309.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14150occurred in iteration=0, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2221.6ms AutomataMinimizationTime, 13 MinimizatonAttempts, 1834 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.4ms SsaConstructionTime, 697.5ms SatisfiabilityAnalysisTime, 2242.6ms InterpolantComputationTime, 1030 NumberOfCodeBlocks, 1030 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 937 ConstructedInterpolants, 0 QuantifiedInterpolants, 6126 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P0Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 713.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 20.3ms, AutomataDifference: 130.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 539.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 92 SDtfs, 48 SDslu, 78 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14150occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2ms SsaConstructionTime, 2.6ms SatisfiabilityAnalysisTime, 12.3ms InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...