/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-14 00:05:07,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-14 00:05:07,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-14 00:05:07,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-14 00:05:07,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-14 00:05:07,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-14 00:05:07,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-14 00:05:07,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-14 00:05:07,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-14 00:05:07,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-14 00:05:07,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-14 00:05:07,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-14 00:05:07,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-14 00:05:07,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-14 00:05:07,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-14 00:05:07,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-14 00:05:07,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-14 00:05:07,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-14 00:05:07,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-14 00:05:07,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-14 00:05:07,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-14 00:05:07,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-14 00:05:07,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-14 00:05:07,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-14 00:05:07,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-14 00:05:07,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-14 00:05:07,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-14 00:05:07,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-14 00:05:07,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-14 00:05:07,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-14 00:05:07,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-14 00:05:07,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-14 00:05:07,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-14 00:05:07,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-14 00:05:07,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-14 00:05:07,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-14 00:05:07,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-14 00:05:07,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-14 00:05:07,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-14 00:05:07,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-14 00:05:07,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-14 00:05:07,592 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-Delay.epf [2021-07-14 00:05:07,612 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-14 00:05:07,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-14 00:05:07,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-14 00:05:07,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-14 00:05:07,615 INFO L138 SettingsManager]: * Use SBE=true [2021-07-14 00:05:07,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-14 00:05:07,615 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-14 00:05:07,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-14 00:05:07,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-14 00:05:07,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-14 00:05:07,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-14 00:05:07,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-14 00:05:07,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-14 00:05:07,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 00:05:07,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-14 00:05:07,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-14 00:05:07,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-14 00:05:07,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-14 00:05:07,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-14 00:05:07,883 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-14 00:05:07,883 INFO L275 PluginConnector]: CDTParser initialized [2021-07-14 00:05:07,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2021-07-14 00:05:07,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46eed992b/437d071bdf544e139bf2a240ae48593d/FLAG60c8e9279 [2021-07-14 00:05:08,403 INFO L306 CDTParser]: Found 1 translation units. [2021-07-14 00:05:08,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2021-07-14 00:05:08,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46eed992b/437d071bdf544e139bf2a240ae48593d/FLAG60c8e9279 [2021-07-14 00:05:08,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46eed992b/437d071bdf544e139bf2a240ae48593d [2021-07-14 00:05:08,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-14 00:05:08,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-14 00:05:08,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-14 00:05:08,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-14 00:05:08,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-14 00:05:08,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:05:08" (1/1) ... [2021-07-14 00:05:08,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16431a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:08, skipping insertion in model container [2021-07-14 00:05:08,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:05:08" (1/1) ... [2021-07-14 00:05:08,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-14 00:05:08,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-14 00:05:09,099 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] [2021-07-14 00:05:09,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:05:09,287 INFO L203 MainTranslator]: Completed pre-run [2021-07-14 00:05:09,295 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] [2021-07-14 00:05:09,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:05:09,388 INFO L208 MainTranslator]: Completed translation [2021-07-14 00:05:09,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09 WrapperNode [2021-07-14 00:05:09,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-14 00:05:09,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-14 00:05:09,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-14 00:05:09,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-14 00:05:09,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-14 00:05:09,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-14 00:05:09,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-14 00:05:09,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-14 00:05:09,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... [2021-07-14 00:05:09,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-14 00:05:09,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-14 00:05:09,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-14 00:05:09,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-14 00:05:09,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 00:05:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-14 00:05:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-14 00:05:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-14 00:05:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-14 00:05:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-14 00:05:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-14 00:05:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-14 00:05:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-14 00:05:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-14 00:05:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-14 00:05:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-14 00:05:09,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-14 00:05:09,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-14 00:05:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-14 00:05:09,557 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-14 00:05:11,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-14 00:05:11,001 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-14 00:05:11,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:05:11 BoogieIcfgContainer [2021-07-14 00:05:11,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-14 00:05:11,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-14 00:05:11,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-14 00:05:11,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-14 00:05:11,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:05:08" (1/3) ... [2021-07-14 00:05:11,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f48881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:05:11, skipping insertion in model container [2021-07-14 00:05:11,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:05:09" (2/3) ... [2021-07-14 00:05:11,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f48881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:05:11, skipping insertion in model container [2021-07-14 00:05:11,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:05:11" (3/3) ... [2021-07-14 00:05:11,009 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2021-07-14 00:05:11,014 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-14 00:05:11,014 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-14 00:05:11,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-14 00:05:11,015 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-14 00:05:11,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,046 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,050 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,050 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,051 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,051 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,051 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,051 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,051 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,060 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:05:11,071 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-14 00:05:11,089 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-14 00:05:11,101 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 00:05:11,101 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 00:05:11,101 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 00:05:11,101 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 00:05:11,101 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 00:05:11,101 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 00:05:11,101 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 00:05:11,101 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-14 00:05:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 13387 states, 11888 states have (on average 2.048956931359354) internal successors, (24358), 13386 states have internal predecessors, (24358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-14 00:05:12,254 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:12,254 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:12,255 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash -518526821, now seen corresponding path program 1 times [2021-07-14 00:05:12,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:12,267 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461465052] [2021-07-14 00:05:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:12,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:12,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:12,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:12,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:12,626 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:05:12,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:12,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:12,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:12,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:12,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:12,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:12,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:12,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:12,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461465052] [2021-07-14 00:05:12,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461465052] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:12,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:12,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:05:12,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010636264] [2021-07-14 00:05:12,667 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:05:12,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:12,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:05:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:05:12,708 INFO L87 Difference]: Start difference. First operand has 13387 states, 11888 states have (on average 2.048956931359354) internal successors, (24358), 13386 states have internal predecessors, (24358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:12,947 INFO L93 Difference]: Finished difference Result 14395 states and 26519 transitions. [2021-07-14 00:05:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:05:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-14 00:05:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:12,982 INFO L225 Difference]: With dead ends: 14395 [2021-07-14 00:05:12,982 INFO L226 Difference]: Without dead ends: 5755 [2021-07-14 00:05:12,983 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:05:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2021-07-14 00:05:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5755. [2021-07-14 00:05:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5755 states, 5707 states have (on average 2.1666374627650256) internal successors, (12365), 5754 states have internal predecessors, (12365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 12365 transitions. [2021-07-14 00:05:13,165 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 12365 transitions. Word has length 71 [2021-07-14 00:05:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:13,165 INFO L482 AbstractCegarLoop]: Abstraction has 5755 states and 12365 transitions. [2021-07-14 00:05:13,165 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 12365 transitions. [2021-07-14 00:05:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-14 00:05:13,172 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:13,172 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:13,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-14 00:05:13,172 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:13,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:13,175 INFO L82 PathProgramCache]: Analyzing trace with hash -921510278, now seen corresponding path program 1 times [2021-07-14 00:05:13,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:13,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263366743] [2021-07-14 00:05:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:13,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:13,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:13,304 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:05:13,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:13,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:13,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:13,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:13,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:13,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263366743] [2021-07-14 00:05:13,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263366743] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:13,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:13,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:05:13,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642175586] [2021-07-14 00:05:13,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:05:13,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:05:13,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:05:13,342 INFO L87 Difference]: Start difference. First operand 5755 states and 12365 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:13,470 INFO L93 Difference]: Finished difference Result 6235 states and 14031 transitions. [2021-07-14 00:05:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:05:13,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-07-14 00:05:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:13,489 INFO L225 Difference]: With dead ends: 6235 [2021-07-14 00:05:13,489 INFO L226 Difference]: Without dead ends: 4891 [2021-07-14 00:05:13,490 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:05:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4891 states. [2021-07-14 00:05:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4891 to 4891. [2021-07-14 00:05:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4843 states have (on average 2.162915548213917) internal successors, (10475), 4890 states have internal predecessors, (10475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 10475 transitions. [2021-07-14 00:05:13,655 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 10475 transitions. Word has length 75 [2021-07-14 00:05:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:13,656 INFO L482 AbstractCegarLoop]: Abstraction has 4891 states and 10475 transitions. [2021-07-14 00:05:13,656 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 10475 transitions. [2021-07-14 00:05:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-14 00:05:13,663 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:13,663 INFO L508 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] [2021-07-14 00:05:13,663 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-14 00:05:13,663 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1491326434, now seen corresponding path program 1 times [2021-07-14 00:05:13,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:13,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179535225] [2021-07-14 00:05:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:13,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:13,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:13,761 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-07-14 00:05:13,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-14 00:05:13,771 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-07-14 00:05:13,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:13,786 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.6 percent of original size [2021-07-14 00:05:13,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-07-14 00:05:13,807 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.1 percent of original size [2021-07-14 00:05:13,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-07-14 00:05:13,824 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:05:13,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:13,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:13,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:13,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:13,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:13,857 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:13,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179535225] [2021-07-14 00:05:13,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179535225] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:13,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:13,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-14 00:05:13,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108160444] [2021-07-14 00:05:13,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-14 00:05:13,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:13,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-14 00:05:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-07-14 00:05:13,859 INFO L87 Difference]: Start difference. First operand 4891 states and 10475 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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) [2021-07-14 00:05:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:14,271 INFO L93 Difference]: Finished difference Result 5763 states and 12967 transitions. [2021-07-14 00:05:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-14 00:05:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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 [2021-07-14 00:05:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:14,291 INFO L225 Difference]: With dead ends: 5763 [2021-07-14 00:05:14,291 INFO L226 Difference]: Without dead ends: 4995 [2021-07-14 00:05:14,291 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 269.4ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-07-14 00:05:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2021-07-14 00:05:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4967. [2021-07-14 00:05:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4967 states, 4919 states have (on average 2.155316121162838) internal successors, (10602), 4966 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 10602 transitions. [2021-07-14 00:05:14,395 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 10602 transitions. Word has length 78 [2021-07-14 00:05:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:14,395 INFO L482 AbstractCegarLoop]: Abstraction has 4967 states and 10602 transitions. [2021-07-14 00:05:14,395 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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) [2021-07-14 00:05:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 10602 transitions. [2021-07-14 00:05:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-14 00:05:14,402 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:14,402 INFO L508 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] [2021-07-14 00:05:14,402 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-14 00:05:14,403 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 727418078, now seen corresponding path program 2 times [2021-07-14 00:05:14,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:14,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720295992] [2021-07-14 00:05:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:14,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:14,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:14,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:05:14,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:05:14,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:05:14,528 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-07-14 00:05:14,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-14 00:05:14,546 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-07-14 00:05:14,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-14 00:05:14,562 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:05:14,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:14,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:14,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:14,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:14,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:14,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:14,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720295992] [2021-07-14 00:05:14,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720295992] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:14,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:14,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-14 00:05:14,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727257263] [2021-07-14 00:05:14,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-14 00:05:14,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:14,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-14 00:05:14,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:05:14,600 INFO L87 Difference]: Start difference. First operand 4967 states and 10602 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 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) [2021-07-14 00:05:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:14,857 INFO L93 Difference]: Finished difference Result 5879 states and 13090 transitions. [2021-07-14 00:05:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-14 00:05:14,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 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 [2021-07-14 00:05:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:14,882 INFO L225 Difference]: With dead ends: 5879 [2021-07-14 00:05:14,882 INFO L226 Difference]: Without dead ends: 5063 [2021-07-14 00:05:14,883 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 192.1ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-07-14 00:05:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2021-07-14 00:05:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 5051. [2021-07-14 00:05:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 5003 states have (on average 2.124325404757146) internal successors, (10628), 5050 states have internal predecessors, (10628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 10628 transitions. [2021-07-14 00:05:14,983 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 10628 transitions. Word has length 78 [2021-07-14 00:05:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:14,984 INFO L482 AbstractCegarLoop]: Abstraction has 5051 states and 10628 transitions. [2021-07-14 00:05:14,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 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) [2021-07-14 00:05:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 10628 transitions. [2021-07-14 00:05:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-14 00:05:14,991 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:14,991 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:14,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-14 00:05:14,992 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2086814507, now seen corresponding path program 1 times [2021-07-14 00:05:14,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:14,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960782667] [2021-07-14 00:05:14,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:15,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:15,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:15,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:05:15,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:05:15,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:05:15,082 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-07-14 00:05:15,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-14 00:05:15,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:05:15,111 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-07-14 00:05:15,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-14 00:05:15,119 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:05:15,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:15,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:15,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:15,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:15,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:15,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960782667] [2021-07-14 00:05:15,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960782667] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:15,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:15,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-14 00:05:15,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841494269] [2021-07-14 00:05:15,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-14 00:05:15,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-14 00:05:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:05:15,152 INFO L87 Difference]: Start difference. First operand 5051 states and 10628 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:15,402 INFO L93 Difference]: Finished difference Result 5351 states and 11464 transitions. [2021-07-14 00:05:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-14 00:05:15,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-07-14 00:05:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:15,413 INFO L225 Difference]: With dead ends: 5351 [2021-07-14 00:05:15,413 INFO L226 Difference]: Without dead ends: 4967 [2021-07-14 00:05:15,413 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 171.1ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-07-14 00:05:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2021-07-14 00:05:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 4799. [2021-07-14 00:05:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4799 states, 4757 states have (on average 2.126550346857263) internal successors, (10116), 4798 states have internal predecessors, (10116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4799 states to 4799 states and 10116 transitions. [2021-07-14 00:05:15,501 INFO L78 Accepts]: Start accepts. Automaton has 4799 states and 10116 transitions. Word has length 80 [2021-07-14 00:05:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:15,501 INFO L482 AbstractCegarLoop]: Abstraction has 4799 states and 10116 transitions. [2021-07-14 00:05:15,501 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4799 states and 10116 transitions. [2021-07-14 00:05:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-14 00:05:15,508 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:15,508 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:15,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-14 00:05:15,508 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1753309287, now seen corresponding path program 1 times [2021-07-14 00:05:15,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:15,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822788325] [2021-07-14 00:05:15,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:15,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:15,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:15,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:15,560 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:05:15,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:15,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:15,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:15,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:15,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:15,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822788325] [2021-07-14 00:05:15,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822788325] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:15,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:15,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:05:15,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666451648] [2021-07-14 00:05:15,593 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:05:15,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:05:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:05:15,594 INFO L87 Difference]: Start difference. First operand 4799 states and 10116 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:15,692 INFO L93 Difference]: Finished difference Result 7451 states and 16861 transitions. [2021-07-14 00:05:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-14 00:05:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-07-14 00:05:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:15,704 INFO L225 Difference]: With dead ends: 7451 [2021-07-14 00:05:15,704 INFO L226 Difference]: Without dead ends: 5225 [2021-07-14 00:05:15,705 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:05:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2021-07-14 00:05:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4575. [2021-07-14 00:05:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4533 states have (on average 2.1248621222148687) internal successors, (9632), 4574 states have internal predecessors, (9632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 9632 transitions. [2021-07-14 00:05:15,798 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 9632 transitions. Word has length 80 [2021-07-14 00:05:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:15,798 INFO L482 AbstractCegarLoop]: Abstraction has 4575 states and 9632 transitions. [2021-07-14 00:05:15,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 9632 transitions. [2021-07-14 00:05:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-14 00:05:15,805 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:15,805 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:15,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-14 00:05:15,806 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:15,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1725766021, now seen corresponding path program 2 times [2021-07-14 00:05:15,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:15,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303869648] [2021-07-14 00:05:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:15,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:15,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:15,848 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:05:15,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:05:15,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:05:15,865 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:05:15,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:15,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:15,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:15,873 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:15,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303869648] [2021-07-14 00:05:15,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303869648] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:15,873 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:15,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:05:15,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199243522] [2021-07-14 00:05:15,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:05:15,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:15,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:05:15,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:05:15,874 INFO L87 Difference]: Start difference. First operand 4575 states and 9632 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:15,960 INFO L93 Difference]: Finished difference Result 5303 states and 10602 transitions. [2021-07-14 00:05:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:05:15,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-07-14 00:05:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:15,967 INFO L225 Difference]: With dead ends: 5303 [2021-07-14 00:05:15,967 INFO L226 Difference]: Without dead ends: 3383 [2021-07-14 00:05:15,967 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 63.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:05:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2021-07-14 00:05:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3383. [2021-07-14 00:05:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3341 states have (on average 2.1571385812630948) internal successors, (7207), 3382 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 7207 transitions. [2021-07-14 00:05:16,027 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 7207 transitions. Word has length 80 [2021-07-14 00:05:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:16,027 INFO L482 AbstractCegarLoop]: Abstraction has 3383 states and 7207 transitions. [2021-07-14 00:05:16,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 7207 transitions. [2021-07-14 00:05:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-14 00:05:16,032 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:16,032 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:16,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-14 00:05:16,032 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2138052609, now seen corresponding path program 1 times [2021-07-14 00:05:16,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:16,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896266463] [2021-07-14 00:05:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:16,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:16,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:16,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:16,079 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:05:16,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:05:16,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:05:16,098 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:05:16,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:16,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:16,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:16,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896266463] [2021-07-14 00:05:16,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896266463] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:16,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:16,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:05:16,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9392101] [2021-07-14 00:05:16,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:05:16,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:05:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:05:16,108 INFO L87 Difference]: Start difference. First operand 3383 states and 7207 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:16,209 INFO L93 Difference]: Finished difference Result 2817 states and 5369 transitions. [2021-07-14 00:05:16,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:05:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 81 [2021-07-14 00:05:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:16,212 INFO L225 Difference]: With dead ends: 2817 [2021-07-14 00:05:16,212 INFO L226 Difference]: Without dead ends: 1519 [2021-07-14 00:05:16,212 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 73.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-14 00:05:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2021-07-14 00:05:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2021-07-14 00:05:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1486 states have (on average 2.016823687752355) internal successors, (2997), 1518 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2997 transitions. [2021-07-14 00:05:16,232 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2997 transitions. Word has length 81 [2021-07-14 00:05:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:16,232 INFO L482 AbstractCegarLoop]: Abstraction has 1519 states and 2997 transitions. [2021-07-14 00:05:16,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2997 transitions. [2021-07-14 00:05:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-14 00:05:16,235 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:16,235 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:16,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-14 00:05:16,235 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -401819460, now seen corresponding path program 1 times [2021-07-14 00:05:16,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:16,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654466721] [2021-07-14 00:05:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:16,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:16,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:16,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:16,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:16,309 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:05:16,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:05:16,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:05:16,329 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:05:16,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:16,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:16,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:16,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654466721] [2021-07-14 00:05:16,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654466721] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:16,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:16,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-14 00:05:16,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657109876] [2021-07-14 00:05:16,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-14 00:05:16,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:16,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-14 00:05:16,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-14 00:05:16,339 INFO L87 Difference]: Start difference. First operand 1519 states and 2997 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:16,471 INFO L93 Difference]: Finished difference Result 1027 states and 1772 transitions. [2021-07-14 00:05:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-14 00:05:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 84 [2021-07-14 00:05:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:16,472 INFO L225 Difference]: With dead ends: 1027 [2021-07-14 00:05:16,472 INFO L226 Difference]: Without dead ends: 435 [2021-07-14 00:05:16,472 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 109.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-14 00:05:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-07-14 00:05:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2021-07-14 00:05:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 426 states have (on average 1.687793427230047) internal successors, (719), 434 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 719 transitions. [2021-07-14 00:05:16,478 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 719 transitions. Word has length 84 [2021-07-14 00:05:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:16,478 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 719 transitions. [2021-07-14 00:05:16,478 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 719 transitions. [2021-07-14 00:05:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-14 00:05:16,480 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:16,480 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:16,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-14 00:05:16,480 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1965189564, now seen corresponding path program 1 times [2021-07-14 00:05:16,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:16,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605030471] [2021-07-14 00:05:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:05:16,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:16,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:05:16,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:05:16,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:05:16,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:05:16,562 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-07-14 00:05:16,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-14 00:05:16,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-14 00:05:16,574 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:05:16,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:05:16,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:16,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:05:16,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:05:16,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:05:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 00:05:16,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:05:16,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605030471] [2021-07-14 00:05:16,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605030471] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:05:16,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:05:16,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-14 00:05:16,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426792506] [2021-07-14 00:05:16,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-14 00:05:16,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:05:16,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-14 00:05:16,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:05:16,611 INFO L87 Difference]: Start difference. First operand 435 states and 719 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:05:16,776 INFO L93 Difference]: Finished difference Result 630 states and 1119 transitions. [2021-07-14 00:05:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:05:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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 89 [2021-07-14 00:05:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:05:16,778 INFO L225 Difference]: With dead ends: 630 [2021-07-14 00:05:16,778 INFO L226 Difference]: Without dead ends: 285 [2021-07-14 00:05:16,778 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 118.3ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-07-14 00:05:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-07-14 00:05:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2021-07-14 00:05:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 276 states have (on average 1.815217391304348) internal successors, (501), 284 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 501 transitions. [2021-07-14 00:05:16,782 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 501 transitions. Word has length 89 [2021-07-14 00:05:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:05:16,782 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 501 transitions. [2021-07-14 00:05:16,782 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-14 00:05:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 501 transitions. [2021-07-14 00:05:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-14 00:05:16,783 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:05:16,783 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-14 00:05:16,783 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-14 00:05:16,783 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:05:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:05:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1839046408, now seen corresponding path program 2 times [2021-07-14 00:05:16,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:05:16,784 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661311110] [2021-07-14 00:05:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:05:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:05:16,817 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:05:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:05:16,849 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:05:16,877 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-14 00:05:16,878 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-14 00:05:16,878 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-14 00:05:16,878 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-14 00:05:16,880 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-14 00:05:16,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:05:16 BasicIcfg [2021-07-14 00:05:16,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-14 00:05:16,966 INFO L168 Benchmark]: Toolchain (without parser) took 8041.56 ms. Allocated memory was 211.8 MB in the beginning and 735.1 MB in the end (delta: 523.2 MB). Free memory was 174.2 MB in the beginning and 483.7 MB in the end (delta: -309.5 MB). Peak memory consumption was 214.7 MB. Max. memory is 8.0 GB. [2021-07-14 00:05:16,966 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 211.8 MB. Free memory was 193.1 MB in the beginning and 193.0 MB in the end (delta: 86.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-07-14 00:05:16,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.80 ms. Allocated memory is still 211.8 MB. Free memory was 174.2 MB in the beginning and 181.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 12.3 MB. Max. memory is 8.0 GB. [2021-07-14 00:05:16,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.80 ms. Allocated memory is still 211.8 MB. Free memory was 181.8 MB in the beginning and 178.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-07-14 00:05:16,967 INFO L168 Benchmark]: Boogie Preprocessor took 33.50 ms. Allocated memory is still 211.8 MB. Free memory was 178.1 MB in the beginning and 176.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:05:16,967 INFO L168 Benchmark]: RCFGBuilder took 1516.03 ms. Allocated memory was 211.8 MB in the beginning and 320.9 MB in the end (delta: 109.1 MB). Free memory was 176.0 MB in the beginning and 282.9 MB in the end (delta: -106.9 MB). Peak memory consumption was 109.6 MB. Max. memory is 8.0 GB. [2021-07-14 00:05:16,967 INFO L168 Benchmark]: TraceAbstraction took 5961.19 ms. Allocated memory was 320.9 MB in the beginning and 735.1 MB in the end (delta: 414.2 MB). Free memory was 282.4 MB in the beginning and 483.7 MB in the end (delta: -201.3 MB). Peak memory consumption was 212.4 MB. Max. memory is 8.0 GB. [2021-07-14 00:05:16,968 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.42 ms. Allocated memory is still 211.8 MB. Free memory was 193.1 MB in the beginning and 193.0 MB in the end (delta: 86.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 462.80 ms. Allocated memory is still 211.8 MB. Free memory was 174.2 MB in the beginning and 181.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 12.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 61.80 ms. Allocated memory is still 211.8 MB. Free memory was 181.8 MB in the beginning and 178.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.50 ms. Allocated memory is still 211.8 MB. Free memory was 178.1 MB in the beginning and 176.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1516.03 ms. Allocated memory was 211.8 MB in the beginning and 320.9 MB in the end (delta: 109.1 MB). Free memory was 176.0 MB in the beginning and 282.9 MB in the end (delta: -106.9 MB). Peak memory consumption was 109.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5961.19 ms. Allocated memory was 320.9 MB in the beginning and 735.1 MB in the end (delta: 414.2 MB). Free memory was 282.4 MB in the beginning and 483.7 MB in the end (delta: -201.3 MB). Peak memory consumption was 212.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 48297, positive: 45289, positive conditional: 45289, positive unconditional: 0, negative: 3008, negative conditional: 3008, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47649, positive: 45289, positive conditional: 0, positive unconditional: 45289, negative: 2360, negative conditional: 0, negative unconditional: 2360, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1024, positive: 977, positive conditional: 0, positive unconditional: 977, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1024, positive: 973, positive conditional: 0, positive unconditional: 973, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 462, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 455, negative conditional: 0, negative unconditional: 455, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47649, positive: 44312, positive conditional: 0, positive unconditional: 44312, negative: 2313, negative conditional: 0, negative unconditional: 2313, unknown: 1024, unknown conditional: 0, unknown unconditional: 1024] , Statistics on independence cache: Total cache size (in pairs): 1024, Positive cache size: 977, Positive conditional cache size: 0, Positive unconditional cache size: 977, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Independence queries for same thread: 648 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L725] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L726] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L727] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L728] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L729] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L735] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L736] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L737] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L738] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L739] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t299; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t301; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L858] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L858] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L859] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L859] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L861] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L862] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5779.0ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 108.7ms, AutomataDifference: 2054.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1091.9ms, PartialOrderReductionTime: 1080.9ms, HoareTripleCheckerStatistics: 1330 SDtfs, 1792 SDslu, 5163 SDs, 0 SdLazy, 751 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 591.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1222.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13387occurred in iteration=0, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 810.7ms AutomataMinimizationTime, 10 MinimizatonAttempts, 858 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.6ms SsaConstructionTime, 370.6ms SatisfiabilityAnalysisTime, 1056.0ms InterpolantComputationTime, 885 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...