/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-keepdead.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-aa1e80b [2020-12-17 23:18:49,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-17 23:18:49,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-17 23:18:49,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-17 23:18:49,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-17 23:18:49,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-17 23:18:49,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-17 23:18:49,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-17 23:18:49,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-17 23:18:49,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-17 23:18:49,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-17 23:18:49,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-17 23:18:49,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-17 23:18:49,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-17 23:18:49,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-17 23:18:49,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-17 23:18:49,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-17 23:18:49,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-17 23:18:49,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-17 23:18:49,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-17 23:18:49,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-17 23:18:49,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-17 23:18:49,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-17 23:18:49,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-17 23:18:49,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-17 23:18:49,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-17 23:18:49,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-17 23:18:49,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-17 23:18:49,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-17 23:18:49,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-17 23:18:49,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-17 23:18:49,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-17 23:18:49,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-17 23:18:49,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-17 23:18:49,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-17 23:18:49,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-17 23:18:49,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-17 23:18:49,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-17 23:18:49,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-17 23:18:49,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-17 23:18:49,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-17 23:18:49,980 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-keepdead.epf [2020-12-17 23:18:50,038 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-17 23:18:50,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-17 23:18:50,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-17 23:18:50,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-17 23:18:50,041 INFO L138 SettingsManager]: * Use SBE=true [2020-12-17 23:18:50,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-17 23:18:50,042 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-17 23:18:50,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-17 23:18:50,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-17 23:18:50,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-17 23:18:50,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-17 23:18:50,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-17 23:18:50,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-17 23:18:50,045 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-17 23:18:50,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-17 23:18:50,045 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-17 23:18:50,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-17 23:18:50,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-17 23:18:50,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-17 23:18:50,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-17 23:18:50,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-17 23:18:50,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-17 23:18:50,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-17 23:18:50,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-17 23:18:50,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-17 23:18:50,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-17 23:18:50,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-17 23:18:50,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-12-17 23:18:50,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-17 23:18:50,049 INFO L138 SettingsManager]: * Remove dead ends from automaton=false [2020-12-17 23:18:50,049 INFO L138 SettingsManager]: * Minimization of abstraction=NONE [2020-12-17 23:18:50,049 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 [2020-12-17 23:18:50,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-17 23:18:50,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-17 23:18:50,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-17 23:18:50,537 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-17 23:18:50,538 INFO L275 PluginConnector]: CDTParser initialized [2020-12-17 23:18:50,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-12-17 23:18:50,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3908ddc4d/933a5e8ce7da402191f76b9043643677/FLAG7f7819754 [2020-12-17 23:18:51,472 INFO L306 CDTParser]: Found 1 translation units. [2020-12-17 23:18:51,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2020-12-17 23:18:51,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3908ddc4d/933a5e8ce7da402191f76b9043643677/FLAG7f7819754 [2020-12-17 23:18:51,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3908ddc4d/933a5e8ce7da402191f76b9043643677 [2020-12-17 23:18:51,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-17 23:18:51,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-12-17 23:18:51,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-17 23:18:51,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-17 23:18:51,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-17 23:18:51,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:18:51" (1/1) ... [2020-12-17 23:18:51,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396a6cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:51, skipping insertion in model container [2020-12-17 23:18:51,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:18:51" (1/1) ... [2020-12-17 23:18:51,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-17 23:18:51,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-17 23:18:52,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-17 23:18:52,319 INFO L203 MainTranslator]: Completed pre-run [2020-12-17 23:18:52,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-17 23:18:52,543 INFO L208 MainTranslator]: Completed translation [2020-12-17 23:18:52,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52 WrapperNode [2020-12-17 23:18:52,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-17 23:18:52,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-17 23:18:52,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-17 23:18:52,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-17 23:18:52,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-17 23:18:52,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-17 23:18:52,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-17 23:18:52,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-17 23:18:52,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (1/1) ... [2020-12-17 23:18:52,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-17 23:18:52,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-17 23:18:52,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-17 23:18:52,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-17 23:18:52,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (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 [2020-12-17 23:18:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-17 23:18:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-17 23:18:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-17 23:18:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-17 23:18:52,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-17 23:18:52,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-17 23:18:52,837 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-17 23:18:52,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-17 23:18:52,838 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-17 23:18:52,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-17 23:18:52,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-17 23:18:52,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-17 23:18:52,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-17 23:18:52,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-17 23:18:52,842 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-17 23:18:55,002 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-17 23:18:55,002 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-17 23:18:55,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:18:55 BoogieIcfgContainer [2020-12-17 23:18:55,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-17 23:18:55,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-17 23:18:55,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-17 23:18:55,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-17 23:18:55,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:18:51" (1/3) ... [2020-12-17 23:18:55,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eb86b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:18:55, skipping insertion in model container [2020-12-17 23:18:55,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:18:52" (2/3) ... [2020-12-17 23:18:55,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eb86b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:18:55, skipping insertion in model container [2020-12-17 23:18:55,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:18:55" (3/3) ... [2020-12-17 23:18:55,015 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2020-12-17 23:18:55,032 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-17 23:18:55,032 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-17 23:18:55,036 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-17 23:18:55,037 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-17 23:18:55,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,076 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,076 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,079 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,079 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,080 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,080 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,088 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:18:55,113 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-17 23:18:55,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-17 23:18:55,152 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-17 23:18:55,152 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-17 23:18:55,153 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-17 23:18:55,153 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-17 23:18:55,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-17 23:18:55,153 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-17 23:18:55,153 INFO L383 AbstractCegarLoop]: Minimize is NONE [2020-12-17 23:18:55,154 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-17 23:18:55,167 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 104 transitions, 223 flow [2020-12-17 23:18:57,148 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18155 states, 18151 states have (on average 3.6902649991735994) internal successors, (66982), 18154 states have internal predecessors, (66982), 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) [2020-12-17 23:18:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 18155 states, 18151 states have (on average 3.6902649991735994) internal successors, (66982), 18154 states have internal predecessors, (66982), 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) [2020-12-17 23:18:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-17 23:18:57,234 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:18:57,236 INFO L504 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] [2020-12-17 23:18:57,237 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:18:57,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:18:57,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1825170948, now seen corresponding path program 1 times [2020-12-17 23:18:57,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:18:57,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629312808] [2020-12-17 23:18:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:18:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:18:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:18:57,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629312808] [2020-12-17 23:18:57,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:18:57,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-17 23:18:57,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690523330] [2020-12-17 23:18:57,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-17 23:18:57,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:18:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-17 23:18:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-17 23:18:57,875 INFO L87 Difference]: Start difference. First operand has 18155 states, 18151 states have (on average 3.6902649991735994) internal successors, (66982), 18154 states have internal predecessors, (66982), 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 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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) [2020-12-17 23:18:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:18:58,330 INFO L93 Difference]: Finished difference Result 15411 states and 55061 transitions. [2020-12-17 23:18:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-17 23:18:58,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2020-12-17 23:18:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:18:58,337 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-17 23:18:58,337 INFO L78 Accepts]: Start accepts. Automaton has 15411 states and 55061 transitions. Word has length 49 [2020-12-17 23:18:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:18:58,340 INFO L481 AbstractCegarLoop]: Abstraction has 15411 states and 55061 transitions. [2020-12-17 23:18:58,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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) [2020-12-17 23:18:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 15411 states and 55061 transitions. [2020-12-17 23:18:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-17 23:18:58,378 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:18:58,378 INFO L504 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] [2020-12-17 23:18:58,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-17 23:18:58,379 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:18:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:18:58,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1387967368, now seen corresponding path program 1 times [2020-12-17 23:18:58,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:18:58,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595335625] [2020-12-17 23:18:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:18:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:18:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:18:58,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595335625] [2020-12-17 23:18:58,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:18:58,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:18:58,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882116619] [2020-12-17 23:18:58,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:18:58,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:18:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:18:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:18:58,899 INFO L87 Difference]: Start difference. First operand 15411 states and 55061 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:18:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:18:59,473 INFO L93 Difference]: Finished difference Result 22171 states and 78825 transitions. [2020-12-17 23:18:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:18:59,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2020-12-17 23:18:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:18:59,476 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:18:59,476 INFO L78 Accepts]: Start accepts. Automaton has 22171 states and 78825 transitions. Word has length 62 [2020-12-17 23:18:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:18:59,477 INFO L481 AbstractCegarLoop]: Abstraction has 22171 states and 78825 transitions. [2020-12-17 23:18:59,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:18:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22171 states and 78825 transitions. [2020-12-17 23:18:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-17 23:18:59,513 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:18:59,513 INFO L504 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] [2020-12-17 23:18:59,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-17 23:18:59,514 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:18:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:18:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash -264030697, now seen corresponding path program 1 times [2020-12-17 23:18:59,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:18:59,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779327482] [2020-12-17 23:18:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:18:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:18:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:18:59,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779327482] [2020-12-17 23:18:59,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:18:59,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:18:59,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78251090] [2020-12-17 23:18:59,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:18:59,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:18:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:18:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:18:59,871 INFO L87 Difference]: Start difference. First operand 22171 states and 78825 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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) [2020-12-17 23:19:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:00,446 INFO L93 Difference]: Finished difference Result 30275 states and 106841 transitions. [2020-12-17 23:19:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:19:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2020-12-17 23:19:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:00,453 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:19:00,453 INFO L78 Accepts]: Start accepts. Automaton has 30275 states and 106841 transitions. Word has length 64 [2020-12-17 23:19:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:00,454 INFO L481 AbstractCegarLoop]: Abstraction has 30275 states and 106841 transitions. [2020-12-17 23:19:00,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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) [2020-12-17 23:19:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30275 states and 106841 transitions. [2020-12-17 23:19:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-17 23:19:00,491 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:00,491 INFO L504 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] [2020-12-17 23:19:00,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-17 23:19:00,492 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -964939050, now seen corresponding path program 1 times [2020-12-17 23:19:00,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:00,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101632237] [2020-12-17 23:19:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:00,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101632237] [2020-12-17 23:19:00,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:00,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-17 23:19:00,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756327494] [2020-12-17 23:19:00,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-17 23:19:00,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-17 23:19:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-17 23:19:00,932 INFO L87 Difference]: Start difference. First operand 30275 states and 106841 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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) [2020-12-17 23:19:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:01,692 INFO L93 Difference]: Finished difference Result 41971 states and 147135 transitions. [2020-12-17 23:19:01,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-17 23:19:01,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 [2020-12-17 23:19:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:01,694 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2020-12-17 23:19:01,694 INFO L78 Accepts]: Start accepts. Automaton has 41971 states and 147135 transitions. Word has length 68 [2020-12-17 23:19:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:01,695 INFO L481 AbstractCegarLoop]: Abstraction has 41971 states and 147135 transitions. [2020-12-17 23:19:01,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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) [2020-12-17 23:19:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 41971 states and 147135 transitions. [2020-12-17 23:19:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-17 23:19:01,740 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:01,740 INFO L504 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] [2020-12-17 23:19:01,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-17 23:19:01,741 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash 610309072, now seen corresponding path program 1 times [2020-12-17 23:19:01,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:01,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924575596] [2020-12-17 23:19:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:02,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924575596] [2020-12-17 23:19:02,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:02,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-17 23:19:02,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671159684] [2020-12-17 23:19:02,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-17 23:19:02,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-17 23:19:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:19:02,228 INFO L87 Difference]: Start difference. First operand 41971 states and 147135 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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) [2020-12-17 23:19:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:03,433 INFO L93 Difference]: Finished difference Result 50861 states and 178261 transitions. [2020-12-17 23:19:03,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-17 23:19:03,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2020-12-17 23:19:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:03,438 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2020-12-17 23:19:03,438 INFO L78 Accepts]: Start accepts. Automaton has 50861 states and 178261 transitions. Word has length 69 [2020-12-17 23:19:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:03,439 INFO L481 AbstractCegarLoop]: Abstraction has 50861 states and 178261 transitions. [2020-12-17 23:19:03,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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) [2020-12-17 23:19:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 50861 states and 178261 transitions. [2020-12-17 23:19:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-17 23:19:03,476 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:03,476 INFO L504 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] [2020-12-17 23:19:03,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-17 23:19:03,477 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash 656206924, now seen corresponding path program 2 times [2020-12-17 23:19:03,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:03,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296554194] [2020-12-17 23:19:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:03,880 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 9 [2020-12-17 23:19:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:04,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296554194] [2020-12-17 23:19:04,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:04,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-17 23:19:04,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481432126] [2020-12-17 23:19:04,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-17 23:19:04,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-17 23:19:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-17 23:19:04,008 INFO L87 Difference]: Start difference. First operand 50861 states and 178261 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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) [2020-12-17 23:19:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:05,295 INFO L93 Difference]: Finished difference Result 58533 states and 204759 transitions. [2020-12-17 23:19:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-17 23:19:05,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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 69 [2020-12-17 23:19:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:05,297 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2020-12-17 23:19:05,297 INFO L78 Accepts]: Start accepts. Automaton has 58533 states and 204759 transitions. Word has length 69 [2020-12-17 23:19:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:05,297 INFO L481 AbstractCegarLoop]: Abstraction has 58533 states and 204759 transitions. [2020-12-17 23:19:05,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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) [2020-12-17 23:19:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 58533 states and 204759 transitions. [2020-12-17 23:19:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-17 23:19:05,339 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:05,339 INFO L504 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] [2020-12-17 23:19:05,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-17 23:19:05,339 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1733308874, now seen corresponding path program 3 times [2020-12-17 23:19:05,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:05,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046271425] [2020-12-17 23:19:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:05,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046271425] [2020-12-17 23:19:05,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:05,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-17 23:19:05,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282799690] [2020-12-17 23:19:05,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-17 23:19:05,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-17 23:19:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-17 23:19:05,540 INFO L87 Difference]: Start difference. First operand 58533 states and 204759 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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) [2020-12-17 23:19:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:06,536 INFO L93 Difference]: Finished difference Result 67073 states and 234178 transitions. [2020-12-17 23:19:06,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-17 23:19:06,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2020-12-17 23:19:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:06,537 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-12-17 23:19:06,537 INFO L78 Accepts]: Start accepts. Automaton has 67073 states and 234178 transitions. Word has length 69 [2020-12-17 23:19:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:06,537 INFO L481 AbstractCegarLoop]: Abstraction has 67073 states and 234178 transitions. [2020-12-17 23:19:06,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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) [2020-12-17 23:19:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 67073 states and 234178 transitions. [2020-12-17 23:19:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-17 23:19:06,581 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:06,582 INFO L504 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] [2020-12-17 23:19:06,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-17 23:19:06,582 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2131353845, now seen corresponding path program 1 times [2020-12-17 23:19:06,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:06,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942544975] [2020-12-17 23:19:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:06,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942544975] [2020-12-17 23:19:06,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:07,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-17 23:19:07,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820388809] [2020-12-17 23:19:07,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-17 23:19:07,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-17 23:19:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-17 23:19:07,139 INFO L87 Difference]: Start difference. First operand 67073 states and 234178 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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) [2020-12-17 23:19:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:08,465 INFO L93 Difference]: Finished difference Result 79169 states and 276249 transitions. [2020-12-17 23:19:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-17 23:19:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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 [2020-12-17 23:19:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:08,466 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2020-12-17 23:19:08,466 INFO L78 Accepts]: Start accepts. Automaton has 79169 states and 276249 transitions. Word has length 70 [2020-12-17 23:19:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:08,466 INFO L481 AbstractCegarLoop]: Abstraction has 79169 states and 276249 transitions. [2020-12-17 23:19:08,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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) [2020-12-17 23:19:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 79169 states and 276249 transitions. [2020-12-17 23:19:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-17 23:19:08,539 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:08,539 INFO L504 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] [2020-12-17 23:19:08,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-17 23:19:08,539 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:08,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2117715599, now seen corresponding path program 2 times [2020-12-17 23:19:08,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:08,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963755947] [2020-12-17 23:19:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:08,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963755947] [2020-12-17 23:19:08,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:08,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-17 23:19:08,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682234150] [2020-12-17 23:19:08,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-17 23:19:08,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-17 23:19:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-12-17 23:19:08,890 INFO L87 Difference]: Start difference. First operand 79169 states and 276249 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 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) [2020-12-17 23:19:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:10,559 INFO L93 Difference]: Finished difference Result 86337 states and 300817 transitions. [2020-12-17 23:19:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-17 23:19:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 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 [2020-12-17 23:19:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:10,567 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2020-12-17 23:19:10,567 INFO L78 Accepts]: Start accepts. Automaton has 86337 states and 300817 transitions. Word has length 70 [2020-12-17 23:19:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:10,567 INFO L481 AbstractCegarLoop]: Abstraction has 86337 states and 300817 transitions. [2020-12-17 23:19:10,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 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) [2020-12-17 23:19:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 86337 states and 300817 transitions. [2020-12-17 23:19:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-17 23:19:10,624 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:10,624 INFO L504 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] [2020-12-17 23:19:10,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-17 23:19:10,625 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash 948240263, now seen corresponding path program 3 times [2020-12-17 23:19:10,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:10,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262420452] [2020-12-17 23:19:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:10,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262420452] [2020-12-17 23:19:10,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:10,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-17 23:19:10,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708427537] [2020-12-17 23:19:10,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-17 23:19:10,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-17 23:19:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-17 23:19:10,959 INFO L87 Difference]: Start difference. First operand 86337 states and 300817 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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) [2020-12-17 23:19:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:12,546 INFO L93 Difference]: Finished difference Result 95969 states and 334161 transitions. [2020-12-17 23:19:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-17 23:19:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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 [2020-12-17 23:19:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:12,548 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-12-17 23:19:12,548 INFO L78 Accepts]: Start accepts. Automaton has 95969 states and 334161 transitions. Word has length 70 [2020-12-17 23:19:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:12,549 INFO L481 AbstractCegarLoop]: Abstraction has 95969 states and 334161 transitions. [2020-12-17 23:19:12,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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) [2020-12-17 23:19:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 95969 states and 334161 transitions. [2020-12-17 23:19:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-17 23:19:12,609 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:12,610 INFO L504 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] [2020-12-17 23:19:12,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-17 23:19:12,610 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:12,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1923893621, now seen corresponding path program 4 times [2020-12-17 23:19:12,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:12,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044006647] [2020-12-17 23:19:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:12,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044006647] [2020-12-17 23:19:12,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:12,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-17 23:19:12,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126608189] [2020-12-17 23:19:12,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-17 23:19:12,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:12,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-17 23:19:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-17 23:19:12,980 INFO L87 Difference]: Start difference. First operand 95969 states and 334161 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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) [2020-12-17 23:19:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:14,594 INFO L93 Difference]: Finished difference Result 101569 states and 353185 transitions. [2020-12-17 23:19:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-17 23:19:14,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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 [2020-12-17 23:19:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:14,595 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2020-12-17 23:19:14,595 INFO L78 Accepts]: Start accepts. Automaton has 101569 states and 353185 transitions. Word has length 70 [2020-12-17 23:19:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:14,595 INFO L481 AbstractCegarLoop]: Abstraction has 101569 states and 353185 transitions. [2020-12-17 23:19:14,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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) [2020-12-17 23:19:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 101569 states and 353185 transitions. [2020-12-17 23:19:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-17 23:19:14,646 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:14,646 INFO L504 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] [2020-12-17 23:19:14,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-17 23:19:14,647 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1141468981, now seen corresponding path program 1 times [2020-12-17 23:19:14,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:14,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837092697] [2020-12-17 23:19:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:14,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837092697] [2020-12-17 23:19:14,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:14,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:19:14,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040361432] [2020-12-17 23:19:14,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:19:14,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:19:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:19:14,790 INFO L87 Difference]: Start difference. First operand 101569 states and 353185 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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) [2020-12-17 23:19:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:15,732 INFO L93 Difference]: Finished difference Result 57321 states and 192144 transitions. [2020-12-17 23:19:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-17 23:19:15,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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 [2020-12-17 23:19:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:15,733 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:19:15,733 INFO L78 Accepts]: Start accepts. Automaton has 57321 states and 192144 transitions. Word has length 70 [2020-12-17 23:19:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:15,733 INFO L481 AbstractCegarLoop]: Abstraction has 57321 states and 192144 transitions. [2020-12-17 23:19:15,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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) [2020-12-17 23:19:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 57321 states and 192144 transitions. [2020-12-17 23:19:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-17 23:19:15,781 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:15,781 INFO L504 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] [2020-12-17 23:19:15,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-17 23:19:15,782 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash 78191343, now seen corresponding path program 1 times [2020-12-17 23:19:15,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:15,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933674302] [2020-12-17 23:19:15,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:15,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933674302] [2020-12-17 23:19:15,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:15,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-17 23:19:15,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614062097] [2020-12-17 23:19:15,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-17 23:19:15,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:15,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-17 23:19:15,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-17 23:19:15,924 INFO L87 Difference]: Start difference. First operand 57321 states and 192144 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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) [2020-12-17 23:19:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:16,266 INFO L93 Difference]: Finished difference Result 20994 states and 68707 transitions. [2020-12-17 23:19:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-17 23:19:16,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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 [2020-12-17 23:19:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:16,267 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-12-17 23:19:16,267 INFO L78 Accepts]: Start accepts. Automaton has 20994 states and 68707 transitions. Word has length 71 [2020-12-17 23:19:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:16,268 INFO L481 AbstractCegarLoop]: Abstraction has 20994 states and 68707 transitions. [2020-12-17 23:19:16,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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) [2020-12-17 23:19:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 20994 states and 68707 transitions. [2020-12-17 23:19:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-17 23:19:16,290 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:16,290 INFO L504 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] [2020-12-17 23:19:16,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-17 23:19:16,290 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1811151828, now seen corresponding path program 1 times [2020-12-17 23:19:16,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:16,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716637099] [2020-12-17 23:19:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:16,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716637099] [2020-12-17 23:19:16,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:16,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-17 23:19:16,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494999488] [2020-12-17 23:19:16,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-17 23:19:16,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-17 23:19:16,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-17 23:19:16,425 INFO L87 Difference]: Start difference. First operand 20994 states and 68707 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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) [2020-12-17 23:19:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:16,717 INFO L93 Difference]: Finished difference Result 31216 states and 101170 transitions. [2020-12-17 23:19:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-17 23:19:16,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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 [2020-12-17 23:19:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:16,719 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:19:16,719 INFO L78 Accepts]: Start accepts. Automaton has 31216 states and 101170 transitions. Word has length 73 [2020-12-17 23:19:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:16,719 INFO L481 AbstractCegarLoop]: Abstraction has 31216 states and 101170 transitions. [2020-12-17 23:19:16,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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) [2020-12-17 23:19:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31216 states and 101170 transitions. [2020-12-17 23:19:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-17 23:19:16,752 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:16,752 INFO L504 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] [2020-12-17 23:19:16,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-17 23:19:16,752 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash -720208070, now seen corresponding path program 2 times [2020-12-17 23:19:16,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:16,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304910018] [2020-12-17 23:19:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:16,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304910018] [2020-12-17 23:19:16,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:16,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:19:16,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374851655] [2020-12-17 23:19:16,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:19:16,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:19:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:19:16,887 INFO L87 Difference]: Start difference. First operand 31216 states and 101170 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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) [2020-12-17 23:19:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:17,864 INFO L93 Difference]: Finished difference Result 55242 states and 177258 transitions. [2020-12-17 23:19:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:19:17,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 [2020-12-17 23:19:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:17,866 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:19:17,866 INFO L78 Accepts]: Start accepts. Automaton has 55242 states and 177258 transitions. Word has length 73 [2020-12-17 23:19:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:17,866 INFO L481 AbstractCegarLoop]: Abstraction has 55242 states and 177258 transitions. [2020-12-17 23:19:17,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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) [2020-12-17 23:19:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55242 states and 177258 transitions. [2020-12-17 23:19:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-17 23:19:17,908 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:17,908 INFO L504 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] [2020-12-17 23:19:17,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-17 23:19:17,909 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash 179832790, now seen corresponding path program 1 times [2020-12-17 23:19:17,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:17,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736020685] [2020-12-17 23:19:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:18,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736020685] [2020-12-17 23:19:18,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:18,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-17 23:19:18,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612854022] [2020-12-17 23:19:18,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-17 23:19:18,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-17 23:19:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-17 23:19:18,056 INFO L87 Difference]: Start difference. First operand 55242 states and 177258 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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) [2020-12-17 23:19:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:18,476 INFO L93 Difference]: Finished difference Result 24570 states and 80346 transitions. [2020-12-17 23:19:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-17 23:19:18,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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 [2020-12-17 23:19:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:18,478 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2020-12-17 23:19:18,478 INFO L78 Accepts]: Start accepts. Automaton has 24570 states and 80346 transitions. Word has length 74 [2020-12-17 23:19:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:18,479 INFO L481 AbstractCegarLoop]: Abstraction has 24570 states and 80346 transitions. [2020-12-17 23:19:18,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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) [2020-12-17 23:19:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 24570 states and 80346 transitions. [2020-12-17 23:19:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-17 23:19:18,520 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:18,521 INFO L504 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] [2020-12-17 23:19:18,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-17 23:19:18,521 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:18,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash 785790006, now seen corresponding path program 1 times [2020-12-17 23:19:18,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:18,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069757949] [2020-12-17 23:19:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:19:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:19:18,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069757949] [2020-12-17 23:19:18,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:19:18,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-17 23:19:18,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201091523] [2020-12-17 23:19:18,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-17 23:19:18,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:19:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-17 23:19:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-17 23:19:18,825 INFO L87 Difference]: Start difference. First operand 24570 states and 80346 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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) [2020-12-17 23:19:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:19:19,367 INFO L93 Difference]: Finished difference Result 31898 states and 102690 transitions. [2020-12-17 23:19:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-17 23:19:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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 78 [2020-12-17 23:19:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:19:19,370 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-12-17 23:19:19,370 INFO L78 Accepts]: Start accepts. Automaton has 31898 states and 102690 transitions. Word has length 78 [2020-12-17 23:19:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:19:19,371 INFO L481 AbstractCegarLoop]: Abstraction has 31898 states and 102690 transitions. [2020-12-17 23:19:19,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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) [2020-12-17 23:19:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 31898 states and 102690 transitions. [2020-12-17 23:19:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-17 23:19:19,430 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:19:19,430 INFO L504 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] [2020-12-17 23:19:19,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-17 23:19:19,430 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:19:19,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:19:19,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1374645194, now seen corresponding path program 2 times [2020-12-17 23:19:19,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:19:19,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705651503] [2020-12-17 23:19:19,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:19:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-17 23:19:19,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-17 23:19:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-17 23:19:19,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-17 23:19:19,611 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-17 23:19:19,612 INFO L605 BasicCegarLoop]: Counterexample might be feasible [2020-12-17 23:19:19,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-17 23:19:19,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 11:19:19 BasicIcfg [2020-12-17 23:19:19,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-17 23:19:19,796 INFO L168 Benchmark]: Toolchain (without parser) took 28119.34 ms. Allocated memory was 302.0 MB in the beginning and 11.6 GB in the end (delta: 11.3 GB). Free memory was 276.9 MB in the beginning and 9.7 GB in the end (delta: -9.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. [2020-12-17 23:19:19,797 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 302.0 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-12-17 23:19:19,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.67 ms. Allocated memory is still 302.0 MB. Free memory was 276.7 MB in the beginning and 282.9 MB in the end (delta: -6.2 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.0 GB. [2020-12-17 23:19:19,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.85 ms. Allocated memory is still 302.0 MB. Free memory was 282.9 MB in the beginning and 280.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-12-17 23:19:19,798 INFO L168 Benchmark]: Boogie Preprocessor took 66.61 ms. Allocated memory is still 302.0 MB. Free memory was 280.7 MB in the beginning and 278.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-12-17 23:19:19,800 INFO L168 Benchmark]: RCFGBuilder took 2272.15 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 278.6 MB in the beginning and 301.0 MB in the end (delta: -22.4 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. [2020-12-17 23:19:19,801 INFO L168 Benchmark]: TraceAbstraction took 24785.68 ms. Allocated memory was 362.8 MB in the beginning and 11.6 GB in the end (delta: 11.2 GB). Free memory was 301.0 MB in the beginning and 9.7 GB in the end (delta: -9.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. [2020-12-17 23:19:19,809 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.25 ms. Allocated memory is still 302.0 MB. Free memory is still 271.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 858.67 ms. Allocated memory is still 302.0 MB. Free memory was 276.7 MB in the beginning and 282.9 MB in the end (delta: -6.2 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 113.85 ms. Allocated memory is still 302.0 MB. Free memory was 282.9 MB in the beginning and 280.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 66.61 ms. Allocated memory is still 302.0 MB. Free memory was 280.7 MB in the beginning and 278.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2272.15 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 278.6 MB in the beginning and 301.0 MB in the end (delta: -22.4 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24785.68 ms. Allocated memory was 362.8 MB in the beginning and 11.6 GB in the end (delta: 11.2 GB). Free memory was 301.0 MB in the beginning and 9.7 GB in the end (delta: -9.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0] [L823] 0 pthread_t t1208; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0] [L824] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L825] 0 pthread_t t1209; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L826] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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, z=0] [L827] 0 pthread_t t1210; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, z=0] [L828] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, 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, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, 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, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, 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, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, 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, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=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=1, 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, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, 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, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, 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, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L17] 0 __assert_fail ("0", "mix045_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 3071 SDtfs, 5882 SDslu, 13214 SDs, 0 SdLazy, 1846 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101569occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1247 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1152 ConstructedInterpolants, 0 QuantifiedInterpolants, 426832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...