/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:30:51,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:30:51,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:30:51,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:30:51,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:30:51,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:30:51,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:30:51,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:30:51,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:30:51,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:30:51,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:30:51,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:30:51,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:30:51,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:30:51,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:30:51,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:30:51,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:30:51,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:30:51,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:30:51,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:30:51,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:30:51,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:30:51,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:30:51,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:30:51,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:30:51,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:30:51,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:30:51,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:30:51,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:30:51,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:30:51,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:30:51,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:30:51,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:30:51,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:30:51,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:30:51,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:30:51,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:30:51,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:30:51,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:30:51,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:30:51,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:30:51,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 05:30:51,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:30:51,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:30:51,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:30:51,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:30:51,946 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:30:51,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:30:51,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:30:51,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:30:51,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:30:51,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:30:51,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:30:51,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:30:51,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:30:51,947 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:30:51,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:30:51,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:30:51,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:30:51,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:30:51,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:30:51,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:30:51,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:30:51,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:30:51,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:30:51,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:30:51,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:30:51,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:30:51,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:30:51,950 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:30:51,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:30:51,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:30:52,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:30:52,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:30:52,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:30:52,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:30:52,276 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:30:52,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i [2019-12-19 05:30:52,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02504d70/e1f8a5fb3a31433b81065d7ca44e9221/FLAGc2023a694 [2019-12-19 05:30:52,895 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:30:52,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i [2019-12-19 05:30:52,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02504d70/e1f8a5fb3a31433b81065d7ca44e9221/FLAGc2023a694 [2019-12-19 05:30:53,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02504d70/e1f8a5fb3a31433b81065d7ca44e9221 [2019-12-19 05:30:53,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:30:53,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:30:53,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:30:53,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:30:53,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:30:53,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:53,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc0254b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53, skipping insertion in model container [2019-12-19 05:30:53,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:53,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:30:53,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:30:53,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:30:53,814 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:30:53,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:30:53,954 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:30:53,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53 WrapperNode [2019-12-19 05:30:53,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:30:53,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:30:53,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:30:53,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:30:53,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:53,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:30:54,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:30:54,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:30:54,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:30:54,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (1/1) ... [2019-12-19 05:30:54,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:30:54,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:30:54,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:30:54,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:30:54,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (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 [2019-12-19 05:30:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:30:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:30:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:30:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:30:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:30:54,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:30:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:30:54,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:30:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-19 05:30:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-19 05:30:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:30:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:30:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:30:54,123 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 05:30:54,804 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:30:54,804 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:30:54,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:30:54 BoogieIcfgContainer [2019-12-19 05:30:54,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:30:54,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:30:54,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:30:54,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:30:54,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:30:53" (1/3) ... [2019-12-19 05:30:54,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60647e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:30:54, skipping insertion in model container [2019-12-19 05:30:54,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:53" (2/3) ... [2019-12-19 05:30:54,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60647e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:30:54, skipping insertion in model container [2019-12-19 05:30:54,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:30:54" (3/3) ... [2019-12-19 05:30:54,819 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_pso.oepc.i [2019-12-19 05:30:54,830 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:30:54,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:30:54,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:30:54,850 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:30:54,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,916 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,916 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,961 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,962 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,976 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,976 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,992 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,994 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:54,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:55,012 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-19 05:30:55,045 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:30:55,045 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:30:55,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:30:55,046 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:30:55,046 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:30:55,046 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:30:55,046 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:30:55,046 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:30:55,061 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 176 transitions [2019-12-19 05:31:13,751 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111186 states. [2019-12-19 05:31:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 111186 states. [2019-12-19 05:31:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 05:31:13,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:13,767 INFO L411 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] [2019-12-19 05:31:13,768 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1109224519, now seen corresponding path program 1 times [2019-12-19 05:31:13,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:13,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783757110] [2019-12-19 05:31:13,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:31:14,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783757110] [2019-12-19 05:31:14,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:14,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:31:14,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229783522] [2019-12-19 05:31:14,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:31:14,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:14,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:31:14,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:31:14,189 INFO L87 Difference]: Start difference. First operand 111186 states. Second operand 4 states. [2019-12-19 05:31:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:15,930 INFO L93 Difference]: Finished difference Result 114114 states and 522350 transitions. [2019-12-19 05:31:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:31:15,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-19 05:31:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:20,004 INFO L225 Difference]: With dead ends: 114114 [2019-12-19 05:31:20,004 INFO L226 Difference]: Without dead ends: 82834 [2019-12-19 05:31:20,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:31:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82834 states. [2019-12-19 05:31:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82834 to 82834. [2019-12-19 05:31:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82834 states. [2019-12-19 05:31:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82834 states to 82834 states and 380410 transitions. [2019-12-19 05:31:27,495 INFO L78 Accepts]: Start accepts. Automaton has 82834 states and 380410 transitions. Word has length 45 [2019-12-19 05:31:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:27,497 INFO L462 AbstractCegarLoop]: Abstraction has 82834 states and 380410 transitions. [2019-12-19 05:31:27,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:31:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 82834 states and 380410 transitions. [2019-12-19 05:31:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 05:31:27,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:27,520 INFO L411 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] [2019-12-19 05:31:27,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1958045590, now seen corresponding path program 1 times [2019-12-19 05:31:27,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:27,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134457588] [2019-12-19 05:31:27,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:31:27,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134457588] [2019-12-19 05:31:27,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:27,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:31:27,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012789142] [2019-12-19 05:31:27,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:31:27,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:31:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:31:27,688 INFO L87 Difference]: Start difference. First operand 82834 states and 380410 transitions. Second operand 5 states. [2019-12-19 05:31:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:29,024 INFO L93 Difference]: Finished difference Result 129234 states and 566702 transitions. [2019-12-19 05:31:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:31:29,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-19 05:31:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:33,828 INFO L225 Difference]: With dead ends: 129234 [2019-12-19 05:31:33,828 INFO L226 Difference]: Without dead ends: 126474 [2019-12-19 05:31:33,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:31:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126474 states. [2019-12-19 05:31:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126474 to 119958. [2019-12-19 05:31:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119958 states. [2019-12-19 05:31:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119958 states to 119958 states and 531549 transitions. [2019-12-19 05:31:37,877 INFO L78 Accepts]: Start accepts. Automaton has 119958 states and 531549 transitions. Word has length 53 [2019-12-19 05:31:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:37,878 INFO L462 AbstractCegarLoop]: Abstraction has 119958 states and 531549 transitions. [2019-12-19 05:31:37,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:31:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 119958 states and 531549 transitions. [2019-12-19 05:31:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 05:31:37,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:37,896 INFO L411 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] [2019-12-19 05:31:37,896 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash 690713249, now seen corresponding path program 1 times [2019-12-19 05:31:37,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:37,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192833342] [2019-12-19 05:31:37,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:31:38,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192833342] [2019-12-19 05:31:38,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:38,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:31:38,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470976481] [2019-12-19 05:31:38,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:31:38,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:38,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:31:38,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:31:38,061 INFO L87 Difference]: Start difference. First operand 119958 states and 531549 transitions. Second operand 5 states. [2019-12-19 05:31:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:43,564 INFO L93 Difference]: Finished difference Result 156370 states and 680698 transitions. [2019-12-19 05:31:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:31:43,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-19 05:31:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:44,102 INFO L225 Difference]: With dead ends: 156370 [2019-12-19 05:31:44,102 INFO L226 Difference]: Without dead ends: 154130 [2019-12-19 05:31:44,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:31:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154130 states. [2019-12-19 05:31:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154130 to 132942. [2019-12-19 05:31:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132942 states. [2019-12-19 05:31:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132942 states to 132942 states and 585323 transitions. [2019-12-19 05:31:48,965 INFO L78 Accepts]: Start accepts. Automaton has 132942 states and 585323 transitions. Word has length 54 [2019-12-19 05:31:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:48,965 INFO L462 AbstractCegarLoop]: Abstraction has 132942 states and 585323 transitions. [2019-12-19 05:31:48,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:31:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 132942 states and 585323 transitions. [2019-12-19 05:31:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 05:31:48,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:48,990 INFO L411 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] [2019-12-19 05:31:48,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1060971801, now seen corresponding path program 1 times [2019-12-19 05:31:48,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:48,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131423550] [2019-12-19 05:31:48,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:31:49,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131423550] [2019-12-19 05:31:49,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:49,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:31:49,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129944290] [2019-12-19 05:31:49,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:31:49,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:49,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:31:49,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:31:49,050 INFO L87 Difference]: Start difference. First operand 132942 states and 585323 transitions. Second operand 3 states. [2019-12-19 05:31:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:55,128 INFO L93 Difference]: Finished difference Result 171274 states and 741340 transitions. [2019-12-19 05:31:55,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:31:55,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-19 05:31:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:55,648 INFO L225 Difference]: With dead ends: 171274 [2019-12-19 05:31:55,649 INFO L226 Difference]: Without dead ends: 171274 [2019-12-19 05:31:55,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:31:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171274 states. [2019-12-19 05:32:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171274 to 151998. [2019-12-19 05:32:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151998 states. [2019-12-19 05:32:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151998 states to 151998 states and 663351 transitions. [2019-12-19 05:32:00,943 INFO L78 Accepts]: Start accepts. Automaton has 151998 states and 663351 transitions. Word has length 56 [2019-12-19 05:32:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:00,944 INFO L462 AbstractCegarLoop]: Abstraction has 151998 states and 663351 transitions. [2019-12-19 05:32:00,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:32:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 151998 states and 663351 transitions. [2019-12-19 05:32:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:32:00,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:00,984 INFO L411 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] [2019-12-19 05:32:00,986 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:00,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1957923899, now seen corresponding path program 1 times [2019-12-19 05:32:00,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:00,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71104704] [2019-12-19 05:32:00,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:32:01,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71104704] [2019-12-19 05:32:01,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:01,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:32:01,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522195649] [2019-12-19 05:32:01,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:32:01,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:01,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:32:01,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:32:01,192 INFO L87 Difference]: Start difference. First operand 151998 states and 663351 transitions. Second operand 6 states. [2019-12-19 05:32:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:07,739 INFO L93 Difference]: Finished difference Result 208582 states and 902701 transitions. [2019-12-19 05:32:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:32:07,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 05:32:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:08,397 INFO L225 Difference]: With dead ends: 208582 [2019-12-19 05:32:08,398 INFO L226 Difference]: Without dead ends: 205382 [2019-12-19 05:32:08,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:32:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205382 states. [2019-12-19 05:32:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205382 to 193070. [2019-12-19 05:32:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193070 states. [2019-12-19 05:32:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193070 states to 193070 states and 837871 transitions. [2019-12-19 05:32:18,987 INFO L78 Accepts]: Start accepts. Automaton has 193070 states and 837871 transitions. Word has length 60 [2019-12-19 05:32:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:18,988 INFO L462 AbstractCegarLoop]: Abstraction has 193070 states and 837871 transitions. [2019-12-19 05:32:18,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:32:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 193070 states and 837871 transitions. [2019-12-19 05:32:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:32:19,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:19,038 INFO L411 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] [2019-12-19 05:32:19,038 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash 540092038, now seen corresponding path program 1 times [2019-12-19 05:32:19,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:19,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158424175] [2019-12-19 05:32:19,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:32:19,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158424175] [2019-12-19 05:32:19,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:19,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:32:19,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395204362] [2019-12-19 05:32:19,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:32:19,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:19,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:32:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:32:19,166 INFO L87 Difference]: Start difference. First operand 193070 states and 837871 transitions. Second operand 7 states. [2019-12-19 05:32:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:30,945 INFO L93 Difference]: Finished difference Result 275526 states and 1157813 transitions. [2019-12-19 05:32:30,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:32:30,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-19 05:32:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:31,860 INFO L225 Difference]: With dead ends: 275526 [2019-12-19 05:32:31,860 INFO L226 Difference]: Without dead ends: 275526 [2019-12-19 05:32:31,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:32:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275526 states. [2019-12-19 05:32:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275526 to 228422. [2019-12-19 05:32:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228422 states. [2019-12-19 05:32:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228422 states to 228422 states and 972797 transitions. [2019-12-19 05:32:39,431 INFO L78 Accepts]: Start accepts. Automaton has 228422 states and 972797 transitions. Word has length 60 [2019-12-19 05:32:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:39,431 INFO L462 AbstractCegarLoop]: Abstraction has 228422 states and 972797 transitions. [2019-12-19 05:32:39,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:32:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 228422 states and 972797 transitions. [2019-12-19 05:32:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:32:39,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:39,487 INFO L411 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] [2019-12-19 05:32:39,487 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:39,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1427595719, now seen corresponding path program 1 times [2019-12-19 05:32:39,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:39,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072158817] [2019-12-19 05:32:39,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:32:39,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072158817] [2019-12-19 05:32:39,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:39,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:32:39,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39747868] [2019-12-19 05:32:39,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:32:39,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:32:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:32:39,576 INFO L87 Difference]: Start difference. First operand 228422 states and 972797 transitions. Second operand 4 states. [2019-12-19 05:32:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:47,710 INFO L93 Difference]: Finished difference Result 185894 states and 771106 transitions. [2019-12-19 05:32:47,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:32:47,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-19 05:32:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:48,257 INFO L225 Difference]: With dead ends: 185894 [2019-12-19 05:32:48,258 INFO L226 Difference]: Without dead ends: 180910 [2019-12-19 05:32:48,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:32:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180910 states. [2019-12-19 05:32:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180910 to 180910. [2019-12-19 05:32:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180910 states. [2019-12-19 05:32:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180910 states to 180910 states and 753597 transitions. [2019-12-19 05:32:53,794 INFO L78 Accepts]: Start accepts. Automaton has 180910 states and 753597 transitions. Word has length 60 [2019-12-19 05:32:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:53,794 INFO L462 AbstractCegarLoop]: Abstraction has 180910 states and 753597 transitions. [2019-12-19 05:32:53,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:32:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 180910 states and 753597 transitions. [2019-12-19 05:32:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:32:53,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:53,827 INFO L411 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] [2019-12-19 05:32:53,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1792364402, now seen corresponding path program 1 times [2019-12-19 05:32:53,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:53,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970964039] [2019-12-19 05:32:53,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:32:53,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970964039] [2019-12-19 05:32:53,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:53,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:32:53,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820213028] [2019-12-19 05:32:53,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:32:53,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:32:53,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:32:53,908 INFO L87 Difference]: Start difference. First operand 180910 states and 753597 transitions. Second operand 6 states. [2019-12-19 05:33:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:01,453 INFO L93 Difference]: Finished difference Result 234266 states and 959370 transitions. [2019-12-19 05:33:01,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:33:01,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 05:33:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:02,174 INFO L225 Difference]: With dead ends: 234266 [2019-12-19 05:33:02,174 INFO L226 Difference]: Without dead ends: 229388 [2019-12-19 05:33:02,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 05:33:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229388 states. [2019-12-19 05:33:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229388 to 183769. [2019-12-19 05:33:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183769 states. [2019-12-19 05:33:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183769 states to 183769 states and 765836 transitions. [2019-12-19 05:33:08,541 INFO L78 Accepts]: Start accepts. Automaton has 183769 states and 765836 transitions. Word has length 60 [2019-12-19 05:33:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:08,541 INFO L462 AbstractCegarLoop]: Abstraction has 183769 states and 765836 transitions. [2019-12-19 05:33:08,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 183769 states and 765836 transitions. [2019-12-19 05:33:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 05:33:08,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:08,578 INFO L411 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] [2019-12-19 05:33:08,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:08,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2025804751, now seen corresponding path program 1 times [2019-12-19 05:33:08,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:08,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460348048] [2019-12-19 05:33:08,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:08,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460348048] [2019-12-19 05:33:08,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:08,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:33:08,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571020092] [2019-12-19 05:33:08,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:33:08,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:33:08,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:33:08,650 INFO L87 Difference]: Start difference. First operand 183769 states and 765836 transitions. Second operand 3 states. [2019-12-19 05:33:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:10,985 INFO L93 Difference]: Finished difference Result 139576 states and 577896 transitions. [2019-12-19 05:33:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:33:10,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 05:33:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:11,405 INFO L225 Difference]: With dead ends: 139576 [2019-12-19 05:33:11,405 INFO L226 Difference]: Without dead ends: 138064 [2019-12-19 05:33:11,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:33:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138064 states. [2019-12-19 05:33:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138064 to 133150. [2019-12-19 05:33:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133150 states. [2019-12-19 05:33:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133150 states to 133150 states and 553578 transitions. [2019-12-19 05:33:21,447 INFO L78 Accepts]: Start accepts. Automaton has 133150 states and 553578 transitions. Word has length 61 [2019-12-19 05:33:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:21,447 INFO L462 AbstractCegarLoop]: Abstraction has 133150 states and 553578 transitions. [2019-12-19 05:33:21,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:33:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 133150 states and 553578 transitions. [2019-12-19 05:33:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 05:33:21,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:21,482 INFO L411 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] [2019-12-19 05:33:21,482 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash -223534845, now seen corresponding path program 1 times [2019-12-19 05:33:21,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:21,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877697759] [2019-12-19 05:33:21,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:21,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877697759] [2019-12-19 05:33:21,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:21,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:33:21,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421775116] [2019-12-19 05:33:21,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:33:21,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:21,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:33:21,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:33:21,552 INFO L87 Difference]: Start difference. First operand 133150 states and 553578 transitions. Second operand 5 states. [2019-12-19 05:33:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:21,706 INFO L93 Difference]: Finished difference Result 26542 states and 98275 transitions. [2019-12-19 05:33:21,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:33:21,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-19 05:33:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:21,747 INFO L225 Difference]: With dead ends: 26542 [2019-12-19 05:33:21,747 INFO L226 Difference]: Without dead ends: 22036 [2019-12-19 05:33:21,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22036 states. [2019-12-19 05:33:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22036 to 21844. [2019-12-19 05:33:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21844 states. [2019-12-19 05:33:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21844 states to 21844 states and 79583 transitions. [2019-12-19 05:33:22,984 INFO L78 Accepts]: Start accepts. Automaton has 21844 states and 79583 transitions. Word has length 62 [2019-12-19 05:33:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:22,985 INFO L462 AbstractCegarLoop]: Abstraction has 21844 states and 79583 transitions. [2019-12-19 05:33:22,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:33:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 21844 states and 79583 transitions. [2019-12-19 05:33:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 05:33:22,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:22,995 INFO L411 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] [2019-12-19 05:33:22,995 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash -565208698, now seen corresponding path program 1 times [2019-12-19 05:33:22,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:22,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802824455] [2019-12-19 05:33:22,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:23,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802824455] [2019-12-19 05:33:23,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:23,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:33:23,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498584829] [2019-12-19 05:33:23,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:33:23,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:33:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:33:23,048 INFO L87 Difference]: Start difference. First operand 21844 states and 79583 transitions. Second operand 4 states. [2019-12-19 05:33:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:23,290 INFO L93 Difference]: Finished difference Result 25690 states and 92959 transitions. [2019-12-19 05:33:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:33:23,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-19 05:33:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:23,337 INFO L225 Difference]: With dead ends: 25690 [2019-12-19 05:33:23,337 INFO L226 Difference]: Without dead ends: 25690 [2019-12-19 05:33:23,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:33:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25690 states. [2019-12-19 05:33:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25690 to 23602. [2019-12-19 05:33:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23602 states. [2019-12-19 05:33:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23602 states to 23602 states and 85585 transitions. [2019-12-19 05:33:23,725 INFO L78 Accepts]: Start accepts. Automaton has 23602 states and 85585 transitions. Word has length 71 [2019-12-19 05:33:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:23,725 INFO L462 AbstractCegarLoop]: Abstraction has 23602 states and 85585 transitions. [2019-12-19 05:33:23,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:33:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 23602 states and 85585 transitions. [2019-12-19 05:33:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 05:33:23,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:23,737 INFO L411 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] [2019-12-19 05:33:23,737 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1177601637, now seen corresponding path program 1 times [2019-12-19 05:33:23,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:23,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132206405] [2019-12-19 05:33:23,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:23,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132206405] [2019-12-19 05:33:23,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:23,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:23,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445481049] [2019-12-19 05:33:23,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:23,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:23,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:23,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:23,817 INFO L87 Difference]: Start difference. First operand 23602 states and 85585 transitions. Second operand 6 states. [2019-12-19 05:33:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:24,274 INFO L93 Difference]: Finished difference Result 30238 states and 108458 transitions. [2019-12-19 05:33:24,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:33:24,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 05:33:24,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:24,330 INFO L225 Difference]: With dead ends: 30238 [2019-12-19 05:33:24,330 INFO L226 Difference]: Without dead ends: 30058 [2019-12-19 05:33:24,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:33:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30058 states. [2019-12-19 05:33:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30058 to 26280. [2019-12-19 05:33:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26280 states. [2019-12-19 05:33:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26280 states to 26280 states and 94905 transitions. [2019-12-19 05:33:26,604 INFO L78 Accepts]: Start accepts. Automaton has 26280 states and 94905 transitions. Word has length 71 [2019-12-19 05:33:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:26,604 INFO L462 AbstractCegarLoop]: Abstraction has 26280 states and 94905 transitions. [2019-12-19 05:33:26,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 26280 states and 94905 transitions. [2019-12-19 05:33:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:26,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:26,622 INFO L411 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] [2019-12-19 05:33:26,622 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1482467152, now seen corresponding path program 1 times [2019-12-19 05:33:26,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:26,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781470542] [2019-12-19 05:33:26,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:26,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781470542] [2019-12-19 05:33:26,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:26,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:33:26,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820171055] [2019-12-19 05:33:26,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:33:26,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:33:26,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:33:26,683 INFO L87 Difference]: Start difference. First operand 26280 states and 94905 transitions. Second operand 4 states. [2019-12-19 05:33:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:27,032 INFO L93 Difference]: Finished difference Result 34914 states and 124766 transitions. [2019-12-19 05:33:27,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:33:27,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-19 05:33:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:27,097 INFO L225 Difference]: With dead ends: 34914 [2019-12-19 05:33:27,098 INFO L226 Difference]: Without dead ends: 34914 [2019-12-19 05:33:27,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:33:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34914 states. [2019-12-19 05:33:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34914 to 29733. [2019-12-19 05:33:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29733 states. [2019-12-19 05:33:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29733 states to 29733 states and 106658 transitions. [2019-12-19 05:33:27,628 INFO L78 Accepts]: Start accepts. Automaton has 29733 states and 106658 transitions. Word has length 75 [2019-12-19 05:33:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:27,628 INFO L462 AbstractCegarLoop]: Abstraction has 29733 states and 106658 transitions. [2019-12-19 05:33:27,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:33:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 29733 states and 106658 transitions. [2019-12-19 05:33:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:27,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:27,653 INFO L411 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] [2019-12-19 05:33:27,653 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1567735663, now seen corresponding path program 1 times [2019-12-19 05:33:27,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:27,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644690127] [2019-12-19 05:33:27,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:27,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644690127] [2019-12-19 05:33:27,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:27,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:27,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618961973] [2019-12-19 05:33:27,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:27,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:27,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:27,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:27,753 INFO L87 Difference]: Start difference. First operand 29733 states and 106658 transitions. Second operand 6 states. [2019-12-19 05:33:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:28,695 INFO L93 Difference]: Finished difference Result 34478 states and 121687 transitions. [2019-12-19 05:33:28,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:33:28,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:33:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:28,758 INFO L225 Difference]: With dead ends: 34478 [2019-12-19 05:33:28,758 INFO L226 Difference]: Without dead ends: 34478 [2019-12-19 05:33:28,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:33:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34478 states. [2019-12-19 05:33:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34478 to 33413. [2019-12-19 05:33:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33413 states. [2019-12-19 05:33:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33413 states to 33413 states and 118236 transitions. [2019-12-19 05:33:29,297 INFO L78 Accepts]: Start accepts. Automaton has 33413 states and 118236 transitions. Word has length 75 [2019-12-19 05:33:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:29,298 INFO L462 AbstractCegarLoop]: Abstraction has 33413 states and 118236 transitions. [2019-12-19 05:33:29,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 33413 states and 118236 transitions. [2019-12-19 05:33:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:29,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:29,323 INFO L411 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] [2019-12-19 05:33:29,323 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:29,324 INFO L82 PathProgramCache]: Analyzing trace with hash 650022290, now seen corresponding path program 1 times [2019-12-19 05:33:29,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:29,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156559422] [2019-12-19 05:33:29,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:29,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156559422] [2019-12-19 05:33:29,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:29,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:29,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257587670] [2019-12-19 05:33:29,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:29,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:29,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:29,430 INFO L87 Difference]: Start difference. First operand 33413 states and 118236 transitions. Second operand 6 states. [2019-12-19 05:33:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:29,975 INFO L93 Difference]: Finished difference Result 39881 states and 137564 transitions. [2019-12-19 05:33:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:33:29,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:33:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:30,046 INFO L225 Difference]: With dead ends: 39881 [2019-12-19 05:33:30,046 INFO L226 Difference]: Without dead ends: 39881 [2019-12-19 05:33:30,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:33:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39881 states. [2019-12-19 05:33:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39881 to 34241. [2019-12-19 05:33:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34241 states. [2019-12-19 05:33:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34241 states to 34241 states and 119102 transitions. [2019-12-19 05:33:30,991 INFO L78 Accepts]: Start accepts. Automaton has 34241 states and 119102 transitions. Word has length 75 [2019-12-19 05:33:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:30,992 INFO L462 AbstractCegarLoop]: Abstraction has 34241 states and 119102 transitions. [2019-12-19 05:33:30,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34241 states and 119102 transitions. [2019-12-19 05:33:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:31,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:31,019 INFO L411 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] [2019-12-19 05:33:31,019 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash 861373203, now seen corresponding path program 1 times [2019-12-19 05:33:31,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:31,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027168522] [2019-12-19 05:33:31,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:31,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027168522] [2019-12-19 05:33:31,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:31,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:33:31,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109640312] [2019-12-19 05:33:31,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:33:31,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:33:31,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:33:31,090 INFO L87 Difference]: Start difference. First operand 34241 states and 119102 transitions. Second operand 5 states. [2019-12-19 05:33:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:31,551 INFO L93 Difference]: Finished difference Result 41646 states and 144386 transitions. [2019-12-19 05:33:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:33:31,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 05:33:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:31,674 INFO L225 Difference]: With dead ends: 41646 [2019-12-19 05:33:31,675 INFO L226 Difference]: Without dead ends: 41646 [2019-12-19 05:33:31,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41646 states. [2019-12-19 05:33:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41646 to 36963. [2019-12-19 05:33:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36963 states. [2019-12-19 05:33:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36963 states to 36963 states and 127705 transitions. [2019-12-19 05:33:32,824 INFO L78 Accepts]: Start accepts. Automaton has 36963 states and 127705 transitions. Word has length 75 [2019-12-19 05:33:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:32,824 INFO L462 AbstractCegarLoop]: Abstraction has 36963 states and 127705 transitions. [2019-12-19 05:33:32,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:33:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 36963 states and 127705 transitions. [2019-12-19 05:33:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:32,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:32,852 INFO L411 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] [2019-12-19 05:33:32,852 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash 350839026, now seen corresponding path program 1 times [2019-12-19 05:33:32,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:32,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665628647] [2019-12-19 05:33:32,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:32,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665628647] [2019-12-19 05:33:32,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:32,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:32,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141297267] [2019-12-19 05:33:32,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:32,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:32,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:32,961 INFO L87 Difference]: Start difference. First operand 36963 states and 127705 transitions. Second operand 6 states. [2019-12-19 05:33:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:33,246 INFO L93 Difference]: Finished difference Result 38259 states and 129280 transitions. [2019-12-19 05:33:33,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:33:33,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:33:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:33,338 INFO L225 Difference]: With dead ends: 38259 [2019-12-19 05:33:33,339 INFO L226 Difference]: Without dead ends: 38259 [2019-12-19 05:33:33,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38259 states. [2019-12-19 05:33:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38259 to 32163. [2019-12-19 05:33:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32163 states. [2019-12-19 05:33:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32163 states to 32163 states and 109074 transitions. [2019-12-19 05:33:33,881 INFO L78 Accepts]: Start accepts. Automaton has 32163 states and 109074 transitions. Word has length 75 [2019-12-19 05:33:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:33,882 INFO L462 AbstractCegarLoop]: Abstraction has 32163 states and 109074 transitions. [2019-12-19 05:33:33,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 32163 states and 109074 transitions. [2019-12-19 05:33:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:33,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:33,904 INFO L411 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] [2019-12-19 05:33:33,904 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash -558608652, now seen corresponding path program 1 times [2019-12-19 05:33:33,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:33,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841154673] [2019-12-19 05:33:33,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:34,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841154673] [2019-12-19 05:33:34,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:34,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:34,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213595272] [2019-12-19 05:33:34,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:34,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:34,025 INFO L87 Difference]: Start difference. First operand 32163 states and 109074 transitions. Second operand 6 states. [2019-12-19 05:33:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:34,175 INFO L93 Difference]: Finished difference Result 13182 states and 40467 transitions. [2019-12-19 05:33:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:33:34,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:33:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:34,198 INFO L225 Difference]: With dead ends: 13182 [2019-12-19 05:33:34,198 INFO L226 Difference]: Without dead ends: 11579 [2019-12-19 05:33:34,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:33:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11579 states. [2019-12-19 05:33:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11579 to 10863. [2019-12-19 05:33:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10863 states. [2019-12-19 05:33:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 33106 transitions. [2019-12-19 05:33:34,370 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 33106 transitions. Word has length 75 [2019-12-19 05:33:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:34,371 INFO L462 AbstractCegarLoop]: Abstraction has 10863 states and 33106 transitions. [2019-12-19 05:33:34,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 33106 transitions. [2019-12-19 05:33:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:34,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:34,383 INFO L411 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, 1, 1, 1] [2019-12-19 05:33:34,384 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash -11366195, now seen corresponding path program 1 times [2019-12-19 05:33:34,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:34,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818531821] [2019-12-19 05:33:34,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:34,673 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-19 05:33:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:34,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818531821] [2019-12-19 05:33:34,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:34,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:33:34,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405683305] [2019-12-19 05:33:34,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:33:34,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:34,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:33:34,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:34,689 INFO L87 Difference]: Start difference. First operand 10863 states and 33106 transitions. Second operand 7 states. [2019-12-19 05:33:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:35,337 INFO L93 Difference]: Finished difference Result 13181 states and 39872 transitions. [2019-12-19 05:33:35,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:33:35,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:33:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:35,357 INFO L225 Difference]: With dead ends: 13181 [2019-12-19 05:33:35,357 INFO L226 Difference]: Without dead ends: 13109 [2019-12-19 05:33:35,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:33:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13109 states. [2019-12-19 05:33:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13109 to 11471. [2019-12-19 05:33:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-12-19 05:33:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 34890 transitions. [2019-12-19 05:33:35,520 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 34890 transitions. Word has length 92 [2019-12-19 05:33:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:35,520 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 34890 transitions. [2019-12-19 05:33:35,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:33:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 34890 transitions. [2019-12-19 05:33:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:35,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:35,534 INFO L411 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, 1, 1, 1] [2019-12-19 05:33:35,534 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:35,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2088575538, now seen corresponding path program 1 times [2019-12-19 05:33:35,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:35,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704519659] [2019-12-19 05:33:35,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:35,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704519659] [2019-12-19 05:33:35,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:35,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:33:35,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730235400] [2019-12-19 05:33:35,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:33:35,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:33:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:35,662 INFO L87 Difference]: Start difference. First operand 11471 states and 34890 transitions. Second operand 7 states. [2019-12-19 05:33:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:35,807 INFO L93 Difference]: Finished difference Result 18947 states and 57202 transitions. [2019-12-19 05:33:35,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:33:35,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:33:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:35,824 INFO L225 Difference]: With dead ends: 18947 [2019-12-19 05:33:35,824 INFO L226 Difference]: Without dead ends: 10295 [2019-12-19 05:33:35,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:33:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10295 states. [2019-12-19 05:33:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10295 to 10295. [2019-12-19 05:33:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10295 states. [2019-12-19 05:33:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10295 states to 10295 states and 31128 transitions. [2019-12-19 05:33:35,952 INFO L78 Accepts]: Start accepts. Automaton has 10295 states and 31128 transitions. Word has length 92 [2019-12-19 05:33:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:35,952 INFO L462 AbstractCegarLoop]: Abstraction has 10295 states and 31128 transitions. [2019-12-19 05:33:35,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:33:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10295 states and 31128 transitions. [2019-12-19 05:33:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:35,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:35,963 INFO L411 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, 1, 1, 1] [2019-12-19 05:33:35,963 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:35,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:35,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1620378800, now seen corresponding path program 2 times [2019-12-19 05:33:35,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:35,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534328879] [2019-12-19 05:33:35,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:36,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534328879] [2019-12-19 05:33:36,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:36,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 05:33:36,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129788837] [2019-12-19 05:33:36,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 05:33:36,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 05:33:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:33:36,092 INFO L87 Difference]: Start difference. First operand 10295 states and 31128 transitions. Second operand 10 states. [2019-12-19 05:33:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:36,720 INFO L93 Difference]: Finished difference Result 28224 states and 85816 transitions. [2019-12-19 05:33:36,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 05:33:36,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-12-19 05:33:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:36,758 INFO L225 Difference]: With dead ends: 28224 [2019-12-19 05:33:36,758 INFO L226 Difference]: Without dead ends: 18666 [2019-12-19 05:33:36,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 05:33:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18666 states. [2019-12-19 05:33:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18666 to 10709. [2019-12-19 05:33:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10709 states. [2019-12-19 05:33:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 32134 transitions. [2019-12-19 05:33:36,945 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 32134 transitions. Word has length 92 [2019-12-19 05:33:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:36,945 INFO L462 AbstractCegarLoop]: Abstraction has 10709 states and 32134 transitions. [2019-12-19 05:33:36,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 05:33:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 32134 transitions. [2019-12-19 05:33:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:36,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:36,957 INFO L411 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, 1, 1, 1] [2019-12-19 05:33:36,957 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1218439478, now seen corresponding path program 3 times [2019-12-19 05:33:36,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:36,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891897500] [2019-12-19 05:33:36,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:33:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:33:37,057 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:33:37,057 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:33:37,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:33:37 BasicIcfg [2019-12-19 05:33:37,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:33:37,379 INFO L168 Benchmark]: Toolchain (without parser) took 164178.83 ms. Allocated memory was 137.4 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 100.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 05:33:37,380 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 05:33:37,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.14 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 154.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:37,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.43 ms. Allocated memory is still 200.3 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:37,383 INFO L168 Benchmark]: Boogie Preprocessor took 35.06 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:37,384 INFO L168 Benchmark]: RCFGBuilder took 748.14 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 106.7 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:37,385 INFO L168 Benchmark]: TraceAbstraction took 162562.89 ms. Allocated memory was 200.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 106.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 05:33:37,391 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.14 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 154.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.43 ms. Allocated memory is still 200.3 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.06 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.14 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 106.7 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 162562.89 ms. Allocated memory was 200.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 106.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L701] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L703] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L705] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L706] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L707] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L708] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L709] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L710] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L711] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2583; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2583, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2584; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2584, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2585; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2585, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 z = 2 [L734] 1 __unbuffered_p0_EAX = x [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 y = y$flush_delayed ? y$mem_tmp : y [L764] 2 y$flush_delayed = (_Bool)0 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 162.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 69.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5827 SDtfs, 7207 SDslu, 14218 SDs, 0 SdLazy, 4034 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228422occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 70.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 195963 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1531 NumberOfCodeBlocks, 1531 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1418 ConstructedInterpolants, 0 QuantifiedInterpolants, 275439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...